Skip to content

Instantly share code, notes, and snippets.

View zyli5313's full-sized avatar

Jake Li zyli5313

3 followers · 6 following
View GitHub Profile
@zyli5313
zyli5313 / 4-8.cpp
Created May 12, 2012 07:30
Copy the solution from book. Cannot run!
// Time complexity O(nlgn). Space complexity O(n)
#include "stdafx.h"
#include "iostream"
#include "list"
using namespace std;
template<typename T>
class TreeNode
{
public:
@zyli5313
zyli5313 / 4-7.cpp
Created May 12, 2012 02:11
// Time complexity best:O(|t1| + |t2|), worst:O(|t1|*|t2|). Space complexity O(1)
#include "stdafx.h"
#include "iostream"
using namespace std;
template<typename T>
class TreeNode
{
public:
@zyli5313
zyli5313 / 4-6.cpp
Created May 11, 2012 15:48
// Time complexity O((logn)^2). Space complexity O(1)
#include "iostream"
#include "assert.h"
using namespace std;
template<typename T>
class TreeNode
{
public:
@zyli5313
zyli5313 / 4-5.cpp
Created May 10, 2012 16:33
// Time complexity O(n). Space complexity O(n)
#include "stdafx.h"
#include "iostream"
using namespace std;
const int MAXINT = 0x7fffffff;
template<typename T>
class TreeNode
{
@zyli5313
zyli5313 / 4-4.cpp
Created May 10, 2012 12:55
// Time complexity O(n). Space complexity O(n)
#include "stdafx.h"
#include "iostream"
#include "vector"
using namespace std;
const int MAXINT = 0x7fffffff;
@zyli5313
zyli5313 / 4-3.cpp
Created May 10, 2012 11:33
// Time complexity O(n). Space complexity O(n)
#include "stdafx.h"
#include "iostream"
using namespace std;
template<typename T>
class TreeNode
{
public:
@zyli5313
zyli5313 / 4-2.cpp
Created May 5, 2012 09:41
// Time complexity O(n). Space complexity O(n)
#include "iostream"
using namespace std;
#define N 7
// Adjacent array( which has a loop 0-1-4-2-0)
int AdjArr[N][N] = {0, 1, 1, 1, 0, 0, 0,
0, 0, 0, 0, 1, 0, 0,
1, 0, 0, 0, 1, 0, 0,
0, 0, 0, 0, 0, 1, 0,
@zyli5313
zyli5313 / 4-1.cpp
Created May 5, 2012 08:51
// Time complexity O(n). Space complexity O(n)
#include "iostream"
#include "assert.h"
using namespace std;
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define ABS(a) (a > 0 ? a : -a)
template<typename T>
class TreeNode
@zyli5313
zyli5313 / 3-6.cpp
Created May 5, 2012 06:52
// Time complexity O(n^2). Space complexity O(n)
#include "iostream"
using namespace std;
#define NUL 0x7fffffff;
//const int NUL = 0x7fffffff;
const int MAXSTKNUM = 1000;
template<typename T>
class Stack
@zyli5313
zyli5313 / 3-5.cpp
Created May 5, 2012 06:32
// Time complexity O(1). Space complexity O(n)
#include "iostream"
using namespace std;
#define NUL 0x7fffffff;
//const int NUL = 0x7fffffff;
const int MAXSTKNUM = 1000;
template<typename T>
class Stack