- 博客(21)
- 资源 (35)
- 收藏
- 关注
原创 [leetcode] Search in Rotated Sorted Array II
Search in Rotated Sorted Array II class Solution { public: int search(int A[], int n, int target) { if(n<=0){ return -1; } int start=0,end=n; w
2014-07-29 00:59:59 425
原创 [leetcode] Search in Rotated Sorted Array
Search in Rotated Sorted Array class Solution { public: int search(int A[], int n, int target) { if(n<=0){ return -1; } int start=0,end=n; while(st
2014-07-29 00:59:38 425
原创 [leetcode] Remove Duplicates from Sorted Array II
Remove Duplicates from Sorted Array II class Solution { public: int removeDuplicates(int A[], int n) { if(n<=2){ return n; } int index=2; for(int i
2014-07-28 21:33:09 425
原创 [leetcode] Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array class Solution { public: int removeDuplicates(int A[], int n) { if(n==0){ return 0; } int index=0;
2014-07-28 21:03:31 407
原创 [leetcode] Convert Sorted List to Binary Search Tree
解法: 把链表转换为vectorz class Solution { public: TreeNode *sortedListToBSTbyIndex(vector &num,int begin,int end){ if (begin>end) { return nullptr; } int mid=be
2014-07-21 21:43:05 508
原创 [leetcode] Convert Sorted Array to Binary Search Tree
Convert Sorted Array to Binary Search Tree class Solution { public: TreeNode *sortedArrayToBSTbyIndex(vector &num,int begin,int end){ if (begin>end) { return null
2014-07-21 21:35:26 530
原创 [leetcode] Construct Binary Tree from Inorder and Postorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal Construct Binary Tree from Inorder and Postorder Traversal
2014-07-21 01:24:19 528
原创 [leetcode] Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal class Solution { public: TreeNode *buildTreebyIndex(vector &preorder,int preBegin,int preEnd,vector &inorder,int inBegin,int inEn
2014-07-21 01:18:08 529
原创 [leetcode] Binary Tree Zigzag Level Order Traversal
class Solution { private: vector> res; public: vector > zigzagLevelOrder(TreeNode *root) { if (root==NULL) { return res; } queue curQ,nextQ;
2014-07-21 00:36:02 515
原创 [leetcode] Binary Tree Inorder Traversal
使用递归 class Solution { private: vector res; public: vector inorderTraversal(TreeNode *root) { if (root!=NULL) { inorderTraversal(root->left); res.push_back(root
2014-07-20 02:36:13 482
原创 [leetcode] Binary Tree Level Order Traversal II
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2014-07-20 02:05:22 451
原创 [leetcode] Binary Tree Level Order Traversal
使用两个队列 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas
2014-07-20 01:36:45 477
原创 [leetcode] Binary Tree Postorder Traversal
Binary Tree Postorder Traversal /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NUL
2014-07-19 16:46:12 491
原创 [leetcode] Binary Tree Preorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2014-07-19 13:34:20 487
原创 最上面的扑克牌
#include #include using namespace std; int main(){ queue Qsrc; for (int i=1; i<=13; i++) { Qsrc.push(i); } //cout<<Qsrc.size()<<endl; int cnt=13; int
2014-07-19 01:51:45 889
原创 [leetcode] Path Sum II
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2014-07-17 21:11:47 546
原创 [leetcode] Path Sum
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2014-07-17 20:47:16 673 1
原创 sorted Array to BST
sorted Array to BST struct BinaryTree{ int value; struct BinaryTree* left; struct BinaryTree* right; BinaryTree(int val){this->value=val;} }; BinaryTree* sortedArrayToBST(int arr[
2014-07-14 14:18:42 803
原创 balanced ternary notation
"Perhaps the prettiest number system of all... is the balanced ternary notation."——Donald Knuth,
2014-07-12 19:54:49 749
原创 quick sort
#include using namespace std; int getDiv(int a[],int low, int high){ int i=low; int j=high; int key=a[low]; while (i<j) { while (ikey) { -
2014-07-12 18:59:46 729
weka 连数据库使用的jar包
2013-04-13
Windows 2003(XP)下安装配置Apache2.2.17+PHP5.2.17+mysql5.5.11服务器
2011-04-22
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人