Two Pointers

186. Reverse Words in a String II

186. Reverse Words in a String II 這個題目是 Reverse Words

557. Reverse Words in a String III

557. Reverse Words in a String III 這一題如果掌握了 151. Reverse

151. Reverse Words in a String

151. Reverse Words in a String 題目是給定一個字串,這個字串的模式是,這個字串很像是一個句子,但是是由多個單字以及「

209. Minimum Size Subarray Sum

209. Minimum Size Subarray Sum class Solution: def minSubArrayLen(self,

19. Remove Nth Node From End of List

19. Remove Nth Node From End of List 這一題我的第一個想法是我先走一趟算出整個 Linked

1095. Find in Mountain Array

1095. Find in Mountain Array

876. Middle of the Linked List

876. Middle of the Linked List # Definition for singly-linked list.

701. Insert into a Binary Search Tree

701. Insert into a Binary Search Tree 如果是要在一個 BST 中插入一個點,

283. Move Zeroes

283. Move Zeroes 這個題目有點陷阱,題目要求要把零搬到最後,不過用這個角度去想的話,題目真的不好想,比較好做的做法需要有反面的想法: 把所有的零搬到後面 == 把所有非零的數字搬到前面

83. Remove Duplicates from Sorted List

83. Remove Duplicates from Sorted List # Definition for singly-linked list.