LeetCode

備忘錄

先試著把Blind 75完成

Easy

13. Roman to Integer

53. Maximum Subarray

70. Climbing Stairs

121. Best Time to Buy and Sell Stock

206. Reverse Linked List

217. Contains Duplicat

235. Lowest Common Ancestor of a Binary Search Tree

283. Move Zeroes

Medium

6. Zigzag Conversion

12. Integer to Roman

17. Letter Combinations of a Phone Number

19. Remove Nth Node From End of List

33. Search in Rotated Sorted Array

48. Rotate Image

152. Maximum Product Subarray

153. Find Minimum in Rotated Sorted Array

198. House Robber

238. Product of Array Except Self

322. Coin Change

429. N-ary Tree Level Order Traversal

729. My Calendar I

814. Binary Tree Pruning

Hard