longhorn

摘要： 需要看一下。 阅读全文

摘要： www.geeksforgeeks.org/diameter-of-a-binary-tree/ 阅读全文

摘要： Implement wildcard pattern matching with support for'?'and'*'.DP:dp[i][j] = 1 表示s[1~i] 和 p[1~j] match。则：if p[j] == '*' && (dp[i][j-1] || dp[i-1][j])dp... 阅读全文

摘要： 1 Arrays.sort(points, new comparator());2 3 public static class comparator implements Comparator {4 public int compare(Point p1, Point p2) {5 ... 阅读全文

摘要： Maximum size square sub-matrix with all 1shttp://www.geeksforgeeks.org/maximum-size-sub-matrix-with-all-1s-in-a-binary-matrix/ 1 public static int max... 阅读全文

摘要： Longest Substring Without Repeating CharactersMinimum Window Substring 阅读全文

摘要： http://www.geeksforgeeks.org/k-largestor-smallest-elements-in-an-array/可以用冒泡排序。外循环k次，不用n次。O(nk)。我想用quick sort的partition。每一次选择一个pivot，然后确定它的index。如果它的位置大于k，那么就在[left, index-1]找；如果它的位置小于k，那么就在[index+1, right]找。直到找到k。这里不能用和quick sort完全一样的partition，因为那个partition不会返回pivot的index。这里的做法是，先把pivot放到数组的末尾。然后对[ 阅读全文

摘要： Given a binary tree, find the lowest common ancestor of two given nodes in the tree. 1 // This function returns pointer to LCA of two given values n1 and n2. 2 // This function assumes that n1 and n2 are present in Binary Tree 3 struct Node *findLCA(struct Node* root, int n1, int n2) 4 { 5 // Ba... 阅读全文

摘要： 写一个shuffle数组的算法给一个数组A[]，里面的数是无序的，比如 A[]={1,2,3,7,3,2,5}shuffle完之后，使之满足A[0]=A[2]= a[2] ....， 当i为n就结束了当i为0, 2, 4...，前i - 1个元素已经满足了。 如果a[ i ] > a[i + 1] 交换a[ i ] 和 a[i + 1]， 这样使得前i个都满足。当i为1,3,5... 同理， 如果a[ i ] A[i+1]) {10 swap(A, i, i+1);11 }12 }13 ... 阅读全文

摘要： Given a binary search tree (BST), find the lowest common ancestor of two given nodes in the BST.4种情况。Both nodes are to the left of the tree.Both nodes are to the right of the tree.One node is on the left while the other is on the right.When the current node equals to either of the two nodes, this no 阅读全文