jumping_grass

摘要： class Solution {public: bool valid(TreeNode *node, stack& s) { if( node == NULL ) return true; stack left,right; if( !valid(node->left,left) ) return false; if( !left.empty() ) { if( left.top() >= node->val ) {... 阅读全文

摘要： class Solution {public: ListNode *removeNthFromEnd(ListNode *head, int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if( head == NULL ) return head; ListNode * root = new ListNode(-1); root->next = head; while(... 阅读全文

摘要： class Solution { public: void comb(vector &candidates,int pos,vector >& v,int target) { if( target == 0 ){ v.push_back(v.back()); } for( int i=pos; i target ) { return; } if(... 阅读全文

摘要： class Solution { public: void comb(vector &candidates,int pos,vector >& v,int target) { if( target == 0 ){ v.push_back(v.back()); } for( int i=pos; i target ) { return; } v.back().p... 阅读全文

摘要： class Solution {public: vector> v; void putqueen(int k,vector &pos) { //cout tmp( pos.size(),s); for(int i=0;i > solveNQueens(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function v.clear(); if( n== 0 ) return v;... 阅读全文

摘要： class Solution {public: void rotate(vector > &matrix) { // Start typing your C/C++ solution below // DO NOT write int main() function if( matrix.size() == 1 ) return; int start = 0; int n = matrix.size(); int tmp = 0; while( start < n ) { ... 阅读全文

摘要： 1 class Solution { 2 public: 3 int trap(int A[], int n) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if( n==0 )return 0; 7 int volum = 0; 8 stack s; 9 s.push(0);10 int t;11 for(int i=1;i= A[... 阅读全文