algorithm - 梦想游戏

前序遍历 struct Node { Node*left; Node*right; int data; Node(){ func; } }; Node* create(Node*p, int depth) { if (p && depth) { p->left = new Node; p->right = new ...

algorithm

2016/10/05 19:01

474

0

1.先反转链表，然后遍历输出 2.遍历一次链表地址加入数组，然后倒叙遍历数组输出。 3.利用stack 遍历一次吧Node加入然后pop输出 4.利用递归 struct Node { Node*next; int data; Node...

algorithm

2016/10/05 18:02

19

0

/// http://developer.51cto.com/art/201403/430986.htm void quickSort(int * a, int left, int right) { int i = left, j = right,key= a[left]; if (left > right)return;//终止条件 ...

algorithm

2016/10/03 13:10

12

0

unsigned long long pow1(int x, int n) { unsigned long long r = 1; while (n--)r *= x; return r; } //二分快速幂 unsigned long long pow2(int x, int n) { unsigned long ...

algorithm

2016/09/28 14:07

7

0

5个基本性质 1.每个节点要么是红要么是黑 2.根节点是黑 3.每个叶子节点是黑的 4.如果一个节点是红的，那么子节点都是黑的 5.对于每个节点，该节点到跟的所有路径包含有相同的黑节点插入新...

algorithm

2016/09/21 13:51

10

0

class Rect { public: int x = 0, y = 0, w = 100, h = 100; Rect(int x, int y, int w, int h) :x(x), y(y), w(w), h(h){} Rect(){}; }; class Point { public: int x = 90, y = 10; ...

algorithm

2016/09/18 14:20

2

0

Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is potentially a very long (leng...

algorithm

2016/09/17 19:41

52

0

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Given nums = [-2, 0, 3, -5, 2, -1] sumRange(0, 2) -> 1 sumRange...

algorithm

2016/09/17 19:10

5

0

套路：最长，最优，最大，最小，最长，计数先写出递归式 string sa = "abcd"; string sb = "becd"; int f(int a, int b) { if (a == 0 || b == 0)return 0; //最小规模为2个字符的比较...

algorithm

2016/09/17 16:58

5

0

套路：最大值，最优，最大，最小，最长，计数 01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求最大价值先暴力递归式...

algorithm

2016/09/17 15:49