john_and_betty的专栏

class Solution { public: void setZeroes(vector > &matrix) { int m=matrix.size(); int n=matrix[0].size(); vectorrow; vectorcol; row.assign(m,0); col.

class Solution { public: vector>res; vector > combinationSum(vector &candidates, int target) { vectorpath; combination(candidates,target,path,0); return res; }

class Solution { public: int uniquePathsWithObstacles(vector > &obstacleGrid) { if(obstacleGrid.size()==0) return 0; int wide=obstacleGrid.size(); int len=obstacleGr

class Solution { public: vector > zigzagLevelOrder(TreeNode *root){ vector>res; if(root==NULL) return res; vectorpath; vectorpath_val; path_val.

class Solution { public: vector > levelOrder(TreeNode *root) { vector path; vectorpath_val; vector> res; if(root==NULL) return res; path.push_ba

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

一直不理解ListNode dimmy(-1)是什么意思，只会依样画葫芦，这题难度很一般 class Solution { public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { ListNode dummy(-1); ListNode *pre=&dummy; while

昨天刚看的扫描算法，现在都可以背下来了 class Solution { public: int maxSubArray(int A[], int n) { int maxh=INT_MIN,maxs=INT_MIN; for(int i=0;i<n;i++) { if(maxh>0)

class Solution { public: void reverseWords(string &s) { vector temp; string str; for(int i=0;i<s.length();i++) { if(s[i]!=' ') {

class Solution { public: bool search(int A[], int n, int target) { for(int i=0;i<n;i++) { if(A[i]==target) return true; } return false

鼓掌鼓掌，刷题以来，第一道一次accept的题目，也难怪通过率这么高 class Solution { public: vector> res; vector > combine(int n, int k) { vectorpath; process(n,1,k,path); return res; }

class Solution { public: int minimumTotal(vector > &triangle) { vector res2; res2.resize(triangle.size()); res2[0]=triangle[0][0]; for(int i=1;i<triangle.size();i++

class Solution { public: bool isValidSudoku(vector > &board) { for(int i=0;i<9;i++) for(int j=0;j<9;j++) { if(board[i][j]!='.') if(!i