1 Star 0 Fork 0

xiangxiang/LeetCode-NOTES

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
贡献代码
同步代码
取消
提示: 由于 Git 不支持空文件夾,创建文件夹后会生成空的 .keep 文件
Loading...
README
MIT

LeetCode算法解答

此页面不断更新LeetCode-中文算法解答。

LeetCode-官方网站

算法解答

1.Two-Sum

2.Add-Two-Numbers

3.Longest-Substring-Without-Repeating-Characters

4.Median-of-Two-Sorted-Arrays

5.Longest-Palindromic-Substring

6.ZigZag-Conversion

7.Reverse-Integer

8.String-to-Integer-(atoi)

9.Palindrome-Number

10.Regular-Expression-Matching

11.Container-With-Most-Water

12.Integer-to-Roman

13.Roman-to-Integer

14.Longest-Common-Prefix

15.3Sum

16.3Sum-Closest

17.Letter-Combinations-of-a-Phone-Number

18.4Sum

19.Remove-Nth-Node-From-End-of-List

20.Valid-Parentheses

21.Merge-Two-Sorted-Lists

22.Generate-Parentheses

23.Merge-k-Sorted-Lists

24.Swap-Nodes-in-Pairs

25.Reverse-Nodes-in-k-Group

26.Remove-Duplicates-from-Sorted-Array

27.Remove-Element

28.Implement-strStr()

29.Divide-Two-Integers

30.Substring-with-Concatenation-of-All-Words

31.Next-Permutation

32.Longest-Valid-Parentheses

33.Search-in-Rotated-Sorted-Array

34.Find-First-and-Last-Position-of-Element-in-Sorted-Array

35.Search-Insert-Position

36.Valid-Sudoku

37.Sudoku-Solver

38.Count-and-Say

39.Combination-Sum

40.Combination-Sum-II

41.First-Missing-Positive

42.Trapping-Rain-Water

43.Multiply-Strings

44.Wildcard-Matching

45.Jump-Game-II

46.Permutations

47.Permutations-II

48.Rotate-Image

49.Group-Anagrams

50.Pow(x,-n)

51.N-Queens

52.N-Queens-II

53.Maximum-Subarray

54.Spiral-Matrix

55.Jump-Game

56.Merge-Intervals

57.Insert-Interval

58.Length-of-Last-Word

59.Spiral-Matrix-II

60.Permutation-Sequence

61.Rotate-List

62.Unique-Paths

63.Unique-Paths-II

64.Minimum-Path-Sum

65.Valid-Number

66.Plus-One

67.Add-Binary

68.Text-Justification

69.Sqrt(x)

70.Climbing-Stairs

72.Edit-Distance

73.Set-Matrix-Zeroes

74.Search-a-2D-Matrix

75.Sort-Colors

76.Minimum-Window-Substring

77.Combinations

78.Subsets

79.Word-Search

80.Remove-Duplicates-from-Sorted-Array-II

81.Search-in-Rotated-Sorted-Array-II

82.Remove-Duplicates-from-Sorted-List-II

83.Remove-Duplicates-from-Sorted-List

84.Largest-Rectangle-in-Histogram

85.Maximal-Rectangle

86.Partition-List

87.Scramble-String

88.Merge-Sorted-Array

89.Gray-Code

90.Subsets-II

91.Decode-Ways

92.Reverse-Linked-List-II

93.Restore-IP-Addresses

94.Binary-Tree-Inorder-Traversal

95.Unique-Binary-Search-Trees-II

96.Unique-Binary-Search-Trees

97.Interleaving-String

98.Validate-Binary-Search-Tree

99.Recover-Binary-Search-Tree

100.Same-Tree

101.Symmetric-Tree

102.Binary-Tree-Level-Order-Traversal

103.Binary-Tree-Zigzag-Level-Order-Traversal

104.Maximum-Depth-of-Binary-Tree

105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal

106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal

107.Binary-Tree-Level-Order-Traversal-II

108.Convert-Sorted-Array-to-Binary-Search-Tree

109.Convert-Sorted-List-to-Binary-Search-Tree

110.Balanced-Binary-Tree

111.Minimum-Depth-of-Binary-Tree

112.Path-Sum

113.Path-Sum-II

114.Flatten-Binary-Tree-to-Linked-List

115.Distinct-Subsequences

116.Populating-Next-Right-Pointers-in-Each-Node

117.Populating-Next-Right-Pointers-in-Each-Node-II

118.Pascal's-Triangle

119.Pascal's-Triangle-II

120.Triangle

121.Best-Time-to-Buy-and-Sell-Stock

122.Best-Time-to-Buy-and-Sell-Stock-II

123.Best-Time-to-Buy-and-Sell-Stock-III

124.Binary-Tree-Maximum-Path-Sum

125.Valid-Palindrome

126.Word-Ladder-II

127.Word-Ladder

128.Longest-Consecutive-Sequence

129.Sum-Root-to-Leaf-Numbers

130.Surrounded-Regions

131.Palindrome-Partitioning

132.Palindrome-Partitioning-II

133.Clone-Graph

134.Gas-Station

135.Candy

136.Single-Number

137.Single-Number-II

138.Copy-List-with-Random-Pointer

139.Word-Break

140.Word-Break-II

141.Linked-List-Cycle

142.Linked-List-Cycle-II

143.Reorder-List

144.Binary-Tree-Preorder-Traversal

145.Binary-Tree-Postorder-Traversal

146.LRU-Cache

147.Insertion-Sort-List

148.Sort-List

149.Max-Points-on-a-Line

150.Evaluate-Reverse-Polish-Notation

151.Reverse-Words-in-a-String

152.Maximum-Product-Subarray

153.Find-Minimum-in-Rotated-Sorted-Array

154.Find-Minimum-in-Rotated-Sorted-Array-II

155.Min-Stack

160.Intersection-of-Two-Linked-Lists

162.Find-Peak-Element

164.Maximum-Gap

165.Compare-Version-Numbers

166.Fraction-to-Recurring-Decimal

167.Two-Sum-II---Input-array-is-sorted

168.Excel-Sheet-Column-Title

169.Majority-Element

171.Excel-Sheet-Column-Number

172.Factorial-Trailing-Zeroes

173.Binary-Search-Tree-Iterator

174.Dungeon-Game

179.Largest-Number

187.Repeated-DNA-Sequences

188.Best-Time-to-Buy-and-Sell-Stock-IV

189.Rotate-Array

190.Reverse-Bits

191.Number-of-1-Bits

198.House-Robber

199.Binary-Tree-Right-Side-View

200.Number-of-Islands

201.Bitwise-AND-of-Numbers-Range

202.Happy-Number

203.Remove-Linked-List-Elements

204.Count-Primes

205.Isomorphic-Strings

206.Reverse-Linked-List

207.Course-Schedule

208.Implement-Trie-(Prefix-Tree)

209.Minimum-Size-Subarray-Sum

210.Course-Schedule-II

211.Add-and-Search-Word---Data-structure-design

213.House-Robber-II

214.Shortest-Palindrome

215.Kth-Largest-Element-in-an-Array

217.Contains-Duplicate

219.Contains-Duplicate-II

220.Contains-Duplicate-III

223.Rectangle-Area

224.Basic-Calculator

225.Implement-Stack-using-Queues

226.Invert-Binary-Tree

230.Kth-Smallest-Element-in-a-BST

231.Power-of-Two

232.Implement-Queue-using-Stacks

234.Palindrome-Linked-List

235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree

237.Delete-Node-in-a-Linked-List

238.Product-of-Array-Except-Self

241.Different-Ways-to-Add-Parentheses

242.Valid-Anagram

257.Binary-Tree-Paths

258.Add-Digits

260.Single-Number-III

263.Ugly-Number

264.Ugly-Number-II

273.Integer-to-English-Words

274.H-Index

278.First-Bad-Version

283.Move-Zeroes

287.Find-the-Duplicate-Number

290.Word-Pattern

292.Nim-Game

299.Bulls-and-Cows

300.Longest-Increasing-Subsequence

303.Range-Sum-Query---Immutable

304.Range-Sum-Query-2D---Immutable

309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown

318.Maximum-Product-of-Word-Lengths

319.Bulb-Switcher

324.Wiggle-Sort-II

326.Power-of-Three

328.Odd-Even-Linked-List

338.Counting-Bits

342.Power-of-Four

343.Integer-Break

344.Reverse-String

345.Reverse-Vowels-of-a-String

347.Top-K-Frequent-Elements

349.Intersection-of-Two-Arrays

350.Intersection-of-Two-Arrays-II

357.Count-Numbers-with-Unique-Digits

367.Valid-Perfect-Square

371.Sum-of-Two-Integers

374.Guess-Number-Higher-or-Lower

378.Kth-Smallest-Element-in-a-Sorted-Matrix

382.Linked-List-Random-Node

383.Ransom-Note

384.Shuffle-an-Array

387.First-Unique-Character-in-a-String

389.Find-the-Difference

391.Perfect-Rectangle

392.Is-Subsequence

394.Decode-String

396.Rotate-Function

399.Evaluate-Division

400.Nth-Digit

401.Binary-Watch

404.Sum-of-Left-Leaves

405.Convert-a-Number-to-Hexadecimal

406.Queue-Reconstruction-by-Height

409.Longest-Palindrome

412.Fizz-Buzz

413.Arithmetic-Slices

414.Third-Maximum-Number

415.Add-Strings

419.Battleships-in-a-Board

423.Reconstruct-Original-Digits-from-English

424.Longest-Repeating-Character-Replacement

434.Number-of-Segments-in-a-String

435.Non-overlapping-Intervals

436.Find-Right-Interval

437.Path-Sum-III

438.Find-All-Anagrams-in-a-String

441.Arranging-Coins

447.Number-of-Boomerangs

448.Find-All-Numbers-Disappeared-in-an-Array

452.Minimum-Number-of-Arrows-to-Burst-Balloons

453.Minimum-Moves-to-Equal-Array-Elements

455.Assign-Cookies

459.Repeated-Substring-Pattern

461.Hamming-Distance

462.Minimum-Moves-to-Equal-Array-Elements-II

463.Island-Perimeter

471.Simplify-Path

476.Number-Complement

485.Max-Consecutive-Ones

496.Next-Greater-Element-I

498.Diagonal-Traverse

503.Next-Greater-Element-II

506.Relative-Ranks

523.Continuous-Subarray-Sum

645.Set-Mismatch

674.Longest-Continuous-Increasing-Subsequence

680.Valid-Palindrome-II

746.Min-Cost-Climbing-Stairs

762.Prime-Number-of-Set-Bits-in-Binary-Representation

824.Goat-Latin

825.Friends-Of-Appropriate-Ages

826.Most-Profit-Assigning-Work

897.Increasing-Order-Search-Tree

906.Super-Palindromes

914.X-of-a-Kind-in-a-Deck-of-Cards

915.Partition-Array-into-Disjoint-Intervals

918.Maximum-Sum-Circular-Subarray

917.Reverse-Only-Letters

919.Complete-Binary-Tree-Inserter

925.Long-Pressed-Name

926.Flip-String-to-Monotone-Increasing

929.Unique-Email-Addresses

930.Binary-Subarrays-With-Sum

933.Number-of-Recent-Calls

934.Shortest-Bridge

937.Reorder-Log-Files

938.Range-Sum-of-BST

939.Minimum-Area-Rectangle

940.Distinct-Subsequences-II

941.Valid-Mountain-Array

942.DI-String-Match

943.Find-the-Shortest-Superstring

944.Delete-Columns-to-Make-Sorted

945.Minimum-Increment-to-Make-Array-Unique

946.Validate-Stack-Sequences

947.Most-Stones-Removed-with-Same-Row-or-Column

948.Bag-of-Tokens

949.Largest-Time-for-Given-Digits

950.Reveal-Cards-In-Increasing-Order

951.Flip-Equivalent-Binary-Trees

952.Largest-Component-Size-by-Common-Factor

953.Verifying-an-Alien-Dictionary

954.Array-of-Doubled-Pairs

955.Delete-Columns-to-Make-Sorted-II

957.Prison-Cells-After-N-Days

958.Check-Completeness-of-a-Binary-Tree

959.Regions-Cut-By-Slashes

973.K-Closest-Points-to-Origin

974.Subarray-Sums-Divisible-by-K

976.Largest-Perimeter-Triangle

The MIT License (MIT) Copyright (c) 2016 默然 Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

简介

LeetCode 算法解答 展开 收起
C++ 等 2 种语言
MIT
取消

发行版

暂无发行版

贡献者

全部

近期动态

不能加载更多了
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiangxiang920/LeetCode-NOTES.git
git@gitee.com:xiangxiang920/LeetCode-NOTES.git
xiangxiang920
LeetCode-NOTES
LeetCode-NOTES
master

搜索帮助