jumping_grass

摘要： 1 class Solution { 2 public: 3 ListNode *rotateRight(ListNode *head, int k) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if( head == NULL ) return head; 7 ListNode * root= new ListNode(-1); 8 root->next = head; 9 ... 阅读全文

摘要： 1 class Solution { 2 public: 3 ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 ListNode* root = new ListNode(-1); 7 ListNode* ptr = root; 8 while( l1!= NULL && l2 !=... 阅读全文

摘要： 1 class Solution { 2 public: 3 string addBinary(string a, string b) { 4 // Start typing your C/C++ solution below 5 // DO NOT write int main() function 6 if( a == "" ) return b; 7 if( b == "" ) return a; 8 9 if( a.length() > b.length() )... 阅读全文

摘要： 1 vector fullJustify(vector &words, int L) { 2 // Start typing your C/C++ solution below 3 // DO NOT write int main() function 4 vector v; 5 string s = ""; 6 for( int i=0; i< words.size(); ) 7 { 8 int l = words[i].length(); 9 ... 阅读全文

摘要： ListNode *deleteDuplicates(ListNode *head) { // Start typing your C/C++ solution below // DO NOT write int main() function if( head == NULL ||head->next == NULL ) return head; ListNode * root = new ListNode (-1 ); root -> next = head; ListNode *ptr = hea... 阅读全文

摘要： 1 int sqrt(int x) { 2 // Start typing your C/C++ solution below 3 // DO NOT write int main() function 4 if( x==0 || x==1) return x; 5 int low = 1; 6 int top = x/2; 7 while( low <= top ) 8 { 9 int mid = (top + low)/2;10 ... 阅读全文

摘要： 1 void swap( int &a, int &b ) 2 { 3 int tmp = a; 4 a = b; 5 b = tmp; 6 return; 7 } 8 void sortColors(int A[], int n) { 9 // Start typing your C/C++ solution below10 // DO NOT write int main() function11 int r = 0, w = 0, b = n-... 阅读全文

摘要： 1 bool isValidSudoku(vector > &board) { 2 // Start typing your C/C++ solution below 3 // DO NOT write int main() function 4 vector > rows(9, vector(9, false)); 5 vector > cols(9, vector(9, false)); 6 vector > blocks(9, vector(9, false)); 7 8 for (int... 阅读全文

摘要： string countAndSay(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function string s = "1"; while( n>1 ) { string t=""; int i = 0; while( i < s.length() ) { int count = 1; ... 阅读全文

摘要： 1 ListNode *reverseKGroup(ListNode *head, int k) { 2 // Start typing your C/C++ solution below 3 // DO NOT write int main() function 4 if( knext = head; 8 ListNode* ptr1 = root; 9 ListNode* ptr2 ;10 ListNode* tmp, *tmp2,*tmp3;11 12 ... 阅读全文