john_and_betty的专栏

class Solution { public: string countAndSay(int n) { string s="1"; for(int i=1;i<=n-1;i++) { string snext=""; int keynum=0; char key='-'

class Solution { public: bool isPalindrome(int x) { if(x<0) return false; int a=x,b=x; int te=0; while(a!=0) { te=te*10+a%10;

>>>>>> class Solution { public: int largestRectangleArea(vector &height) { int maxarea=0; stacks; for(int i=0;i<height.size();i++) { if(s.empty())

class Solution { public: vectorres; vectortemp; vector*dp; vector wordBreak(string s,unordered_set&dict) { dp=new vector[s.size()]; for(int i=0;i<s.size();i++) for(int j=i;j<s.size();j++)

class Solution { public: vector> partition(string s) { vector>res; vectorpath; if(s.size()==0) return res; store(res,path,s); } void store(vector

class Solution { public: int ladderLength(string start, string end, unordered_set &dict) { queue>q; unordered_setvisited; q.push(make_pair(start,1)); visited.insert

class Solution { public: vector insert(vector &intervals, Interval newInterval) { vectorres; for(int i=0;i<intervals.size();i++) { if(intervals[i].end<newInterv

class Solution { public: bool isMatch(const char *s, const char *p) { const char *ss=s; const char *star=NULL; while(*s!='\0') { if(*s==*p||*s=

class Solution { public: int maxProfit(vector &prices) { if(prices.size()<=1) return 0; int left[prices.size()]; int minp=prices[0]; left[0]=0;

class Solution { public: vector generateTrees(int n) { return generate(0,n-1); } vector generate(int begin,int end) { vectorres; if(begin>end) {

智商是硬伤啊，昨天在华为做了一道简单的递归都没写出来，尼玛，现在想想实在是愚蠢至极，还特么想拿华为当垫脚石，递归都不会 class Solution { public: TreeNode *sortedArrayToBST(vector &num) { return sorta(num,0,num.size()-1); } TreeNode

class Solution { public: TreeNode *sortedListToBST(ListNode *head) { ListNode *p; int count=0; p=head; while(p!=NULL) { count++; p=p

class Solution { public: int divide(int dividend, int divisor) { if(dividend==0) return 0; int tag=0; if(dividend>0&&divisor0) tag=1; long l

class Solution { public: int removeDuplicates(int A[], int n) { if(n<=1) return n; int j=1; int value=A[0]; int count=1; for(int i=1;i<n;i++)

今天的几道题都没怎么搞懂。。 class Solution { public: vector spiralOrder(vector > &matrix) { vectorans; if(matrix.size()==0) return ans; int x1=0,x2=matrix.size()-1,y1=0,y2=ma

Matrix[i][j]-------->>>>Matrix[j][n - i] 每4个元素为一组相互交换。 class Solution { public: void rotate(vector > &matrix) { int n=matrix.size()-1; for(int i=0;i<n;i++) fo

class Solution { public: int numDecodings(string s) { if(s.size()==0) return 0; int f[s.size()]; if(s[0]=='0') f[0]=0; else f[0]=1;

找出两个已排序数组的中间数，还没看懂。。 class Solution { public: double findMedianSortedArrays(int A[], int m, int B[], int n) { int total=m+n; if(total%2!=0) return find(A,m,B,n,tota

class Solution { public: int canCompleteCircuit(vector &gas, vector &cost) { int sum=0,total=0,i,start=0; for(i=0;i<gas.size();i++) { sum=sum+gas[i]-cost[i];

需要考虑的比较多，容易错 class Solution { public: bool isValid(string s) { if(s.size()==0) return false; if(s.size()%2==1) return false; stackstr; int i=

class Solution { public: vector plusOne(vector &digits) { vectorres; int num=1; for(int i=digits.size()-1;i>=0;i--) { num=num+digits[i]; res

没看懂题目，看了这个：http://www.cnblogs.com/codingmylife/archive/2012/09/05/2671548.html 大意就是，找出任意两个板之间所夹的最大面积，用两个指针，分别指向首尾，计算面积后，改变较小指针的指向 class Solution { public: int maxArea(vector &height) { i

class Solution { public: int maxpath(TreeNode *root,int &maxlocal) { if(root==NULL) return 0; int local=root->val; int left=maxpath(root->left,maxlocal);

完全就是照打一遍 class Solution { public: bool isNumber(const char *s) { if(s==NULL) return false; while(*s==' ') s++; if(*s=='+'||*s=='-') s+

不会写。。。 class Solution { public: int f[1000][1000]; int maximalRectangle(vector > &matrix) { for(int i=0;i<matrix.size();i++) f[i][0]=matrix[i][0]=='1'?1:0; for(in

一个点所能容纳的水由它左侧和右侧的最大高度决定，两次扫描得到最大高度，这个点能容纳的水量是由最大高度里面的最小值减去点的高度决定 class Solution { public: int trap(int A[], int n) { if(n<=2) return 0; int leftmax[n]; leftmax[

const double INF=1E9; class Solution { public: int maxPoints(vector &points) { if(points.size()==0) return 0; unordered_mapmp; int res=1; for(int i=

我居然不会！！傻瓜题目！！！可以细化到，一个根节点下面两个子节点之间的比较 class Solution { public: bool isSymmetric(TreeNode *root) { if(root==NULL) return true; return judge(root->left,root->right);

class Solution { public: void connect(TreeLinkNode *root) { if(!root)return ; if(root->left) root->left->next=root->right; if(root->right) root->rig

class Solution { public: TreeNode *buildTree(vector &inorder, vector &postorder) { if(inorder.size()==0) return NULL; return traverse(inorder,0,inorder.size()-1,postorde

class Solution { public: void solveSudoku(vector > &board) { solve(board); } bool solve(vector>&board) { for(int i=0;i<9;i++) for(int j=0;j<9;j++)