2
CHAPTER 0: FOREWORD ....................................................................................................................... 4
CHAPTER 1: ARRAY/STRING ............................................................................................................... 5
1. TWO SUM .................................................................................................................................................. 5
2. TWO SUM II – INPUT ARRAY IS SORTED ................................................................................................. 6
3. TWO SUM III – DATA STRUCTURE DESIGN ............................................................................................. 8
4. VALID PALINDROME .............................................................................................................................. 10
5. IMPLEMENT STRSTR() ........................................................................................................................... 11
6. REVERSE WORDS IN A STRING ............................................................................................................. 12
7. REVERSE WORDS IN A STRING II .......................................................................................................... 13
8. STRING TO INTEGER (ATOI) ................................................................................................................. 14
9. VALID NUMBER ...................................................................................................................................... 16
10. LONGEST SUBSTRING WITHOUT REPEATING CHARACTERS ........................................................... 19
11. LONGEST SUBSTRING WITH AT MOST TWO DISTINCT CHARACTERS ............................................ 21
12. MISSING RANGES ................................................................................................................................. 23
13. LONGEST PALINDROMIC SUBSTRING ................................................................................................. 24
14. ONE EDIT DISTANCE ........................................................................................................................... 27
15. READ N CHARACTERS GIVEN READ4 ................................................................................................ 29
16. READ N CHARACTERS GIVEN READ4 – CALL MULTIPLE TIMES ...................................................... 30
CHAPTER 2: MATH ............................................................................................................................... 32
17. REVERSE INTEGER .............................................................................................................................. 32
18. PLUS ONE ............................................................................................................................................. 34
19. PALINDROME NUMBER ....................................................................................................................... 35
CHAPTER 3: LINKED LIST .................................................................................................................. 37
20. MERGE TWO SORTED LISTS ............................................................................................................... 37
21. ADD TWO NUMBERS ........................................................................................................................... 38
22. SWAP NODES IN PAIRS ....................................................................................................................... 39
23. MERGE K SORTED LINKED LISTS ....................................................................................................... 40
24. COPY LIST WITH RANDOM POINTER ................................................................................................. 43
CHAPTER 4: BINARY TREE ................................................................................................................ 46
25. VALIDATE BINARY SEARCH TREE ...................................................................................................... 46
26. MAXIMUM DEPTH OF BINARY TREE ................................................................................................. 49
27. MINIMUM DEPTH OF BINARY TREE .................................................................................................. 50
28. BALANCED BINARY TREE ................................................................................................................... 52
29. CONVERT SORTED ARRAY TO BALANCED BINARY SEARCH TREE .................................................. 54
30. CONVERT SORTED LIST TO BALANCED BINARY SEARCH TREE ....................................................... 56
31. BINARY TREE MAXIMUM PATH SUM ................................................................................................. 58
32. BINARY TREE UPSIDE DOWN ............................................................................................................. 60
CHAPTER 5: BIT MANIPULATION ................................................................................................... 62
33. SINGLE NUMBER .................................................................................................................................. 62
34. SINGLE NUMBER II .............................................................................................................................. 64
CHAPTER 6: MISC .................................................................................................................................. 66
- 1
- 2
- 3
- 4
- 5
- 6
前往页