New Year, New Start. Leet Code Records (3-5 per day)

2019-01-07:
1). 34. Find First and Last Position of Element in Sorted Array
2). 36. Valid Sudoku
3). 38. Count and Say
4). 39. Combination Sum
5). 40. Combination Sum II        

2019-01-06
1). 17. Letter Combinations of a Phone Number
2). 19. Remove Nth Node From End of List
3). 20. Valid Parentheses
4). 21. Merge Two Sorted Lists
5). 22. Generate Parentheses
6). 23. Merge k Sorted Lists
7). 26. Remove Duplicates from Sorted Array
8). 28. Implement strStr()
9). 29. Divide Two Integers
10). 33. Search in Rotated Sorted Array
This is the second round, post the one that improved.

1. class Solution {
   
2. public:
   
3.     int strStr(string haystack, string needle) {
   
4.         const int size_h = haystack.size();
   
5.         const int size_n = needle.size();
   
6.         if (0 == size_n) return 0;
   
7.         vector<int> lps(size_n, 0);
   
8.         for (int i = 1; i < size_n; i++) {
   
9.             int pos = lps[i-1];
   
10.             while (pos > 0 && needle[pos] != needle[i]) pos = lps[pos - 1];
    
11.             if (needle[pos] == needle[i]) lps[i] = pos + 1;
    
12.         }
    
13.         int idx_h = 0, idx_n = 0;
    
14.         for (; idx_h < size_h; idx_h++) {
    
15.             while (idx_n > 0 && needle[idx_n] != haystack[idx_h]) idx_n = lps[idx_n - 1];
    
16.             if (needle[idx_n] == haystack[idx_h]) idx_n++;
    
17.             if (idx_n == size_n) return idx_h - size_n + 1;
    
18.         }
    
19.         return -1;
    
20.     }
    
21. };

复制代码

2019-01-05
1). 2. Add Two Numbers
2). 3. Longest Substring Without Repeating Characters
3). 5. Longest Palindromic Substring  
4). 7. Reverse Integer
5). 8. String to Integer (atoi)
6). 10. Regular Expression Matching
7). 11. Container With Most Water
8).13. Roman to Integer  
9). 14. Longest Common Prefix
10). 15. 3Sum

Happy Friday, Have a rest today.

2019-01-03:
1). 68 Text Justification
2). 289 Game of Life
3). 290 Word Pattern
4). 1 Two Sum
5). 4 Median of Two Sorted Arrays

2019-01-02
1).  284 Peeking Iterator   
2).  285 Inorder Successor in BST
3).  286 Walls and Gates
4).  287 Find the Duplicate Number  
5). 288        Unique Word Abbreviation  

love1point 发表于 2019-1-2 08:42
楼主是学生吗？还是在职刷题

zai zhi shua..........

楼主是学生吗？还是在职刷题

加油，给所有新年还在刷题的鞋童们点赞。 一定会收获dream offer

加油！也刚做了wiggle sort哈哈