再次出发的专栏

int maxProfit_T(vector &prices) //Best Time to Buy and Sell Stock { if(prices.size()<2) return 0; int profit=0; int cur_min=prices[0]; for (int i=0;i<prices.size();i++) { profit=max(pric

vector inorderTraversal(TreeNode *root) //Binary Tree inorder Traversal { if (root==NULL) {return t; } inorderTraversal(root->left); t.push_back(root->val); inorderTraversal(root->rig

bool isSameTree(TreeNode *p, TreeNode *q) //判断是否是相同二叉树 { if(p==NULL&&NULL==q) return true; if((p!=NULL&&NULL==q)||(p==NULL&&NULL!=q)) return false; if(p->val==q->val) { return isSameTree(p

int maxDepth(TreeNode *root) //递归求二叉树最大深度 { if(root==NULL) return 0; int u,v; u=maxDepth(root->left); v=maxDepth(root->right); if(u>v) return (u+1); else return (v+1); }

int singleNumber(int A[],int n) //成对数中找单个数 { if (n==0) exit(0); if(n==1) return 0; int i=0,j,t; t=A[0]; for(i=1;i<n;i++) { t=A[i]^t; } return t; }

int levelTraverse2(TreeNode* tree)//按层遍历二叉树，递归实现 { if(tree==NULL) return 0; int depth=maxDepth(tree)+1; for(int i=1;i<depth;i++) { lvlTraverse(tree,i); } }

int levelTraverse(TreeNode* tree) //按层遍历二叉树,队列实现 { if(tree==NULL) {return 0;} TreeNode* p; p=tree; queue q; q.push(p); //int level=maxDepth(tree); while (!q.empty()) { p=q.f

ListNode *deleteDuplicates(ListNode *head) //Remove Duplicates from Sorted List II { if(head==NULL||head->next==NULL) return head; ListNode* cur=head,*pre; ListNode dummy(INT_MIN); pre=&du

ListNode *mergeKLists(vector &lists) //Merge K Sorted Lists { if(lists.size()==0) return NULL; ListNode* p=lists[0]; for (int i=1;i<lists.size();i++) { p=mergeTwoLists(p,lists[i]); }

void merge(int A[], int m, int B[], int n) //Merge Sorted Array { int i,j; for(i=0,j=0;i<m+j&&j<n;) { if (A[i]<=B[j]) i++; else { insert_num(A,i,m+j,B[j]);i++;j++; } } if(

vector postorderTraversal(TreeNode *root) //Binary Tree Postorder Traversal { if (root==NULL) {return t; } postorderTraversal(root->left); postorderTraversal(root->right); t.push_bac

vector generateTrees(int n) //Unique Binary Search Trees II { if (n == 0) return generate(1, 0); return generate(1, n); }vector generate(int start, int end) { vector subTree; if (start >

int minDepth(TreeNode *root) //二叉树最小深度 { int l,r; if(root==NULL) return 0; if(root->left==NULL&&root->right==NULL) { return 1; } else if(root->left!=NULL&&root->right!=NULL) { l

int removeDuplicates(int A[], int n) //Remove Duplicates from Sorted Array { if (n == 0) return 0; int index = 0; for (int i = 1; i < n; i++) { if (A[index] != A[i]) A[++index] = A[i];

int removeDuplicates(int A[], int n) //Remove Duplicates from Sorted Array { if (n == 0) return 0; int index = 0; for (int i = 1; i < n; i++) { if (A[index] != A[i]) A[++index] = A[i];

int removeElement(int A[], int n, int elem) //Remove Element { int num=0; for (int i=0;i<n-num;i++) { if (A[i]==elem) { while(i!=n-num-1){ if(A[n-num-1]!=elem) {A[i]=A[n-num-

int singleNumber(int A[], int n)//Single Number II { int b; int count[sizeof(int)*8]={}; for(int j=0;j<32;j++) { for (int i=0;i<n;i++) { b=1; b&=(A[i]>>j); count[j]+=b;

解法一：int maxprofit2(vector &prices) //Best Time to Buy and Sell Stock II { //cout<<prices[0]; if (prices.size()==0||prices.size()==1) {return 0; } int i=0,j=0,profit=0; while (prices[i]>

int reverse(int x) //整数取反输出 { int y; if(x==0) return 0; else if(x<0){y=-x;} else y=x; int a[32]={},tmp,i=0; while(y!=0) { tmp=y%10; a[i]=tmp; y/=10;i++; } i--; int _

int numTrees(int n) //Unique Binary Search Trees { vector f(n+1,0); f[0]=1;f[1]=1; for(int k=2;k<=n;++k) for(int i=1;i<=k;++i) f[k]+=f[i-1]*f[k-i]; return f[n]; }

int maxDepth_2(TreeNode* root) //非递归求二叉树最大深度 { TreeNode *p,*have_visited; int treeDepth=0; vector v_tree; p=root; have_visited=NULL; while(p||!v_tree.empty()) { if (p) { v_t

vector preorderTraversal(TreeNode *root) //Binary Tree Preorder Traversal { if (root==NULL) {return t; } t.push_back(root->val); preorderTraversal(root->left); preorderTraversal(root->

int searchInsert(int A[], int n, int target)//Search Insert Position { if(n==0||A==NULL) return 0; int index; for (int i=0;i<n;i++) { if(i==0&&A[i]>target) return 0; if(i==n-1&&A[i]<tar