870. Advantage Shuffle
870. Advantage Shuffle
class Solution:
def advantageCount(self, nums1: List[
Two Pointers
2095. Delete the Middle Node of a Linked List
2095. Delete the Middle Node of a Linked List
# Definition
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
題目是給定一個字串，這個字串的模式是，這個字串很像是一個句子，但是是由多個單字以及「
5. Longest Palindromic Substring
5. Longest Palindromic Substring
這一題是我們要找出子字串中的最長的回文，其實最好從暴力解法開始學習起，前面的題目已經重複提過了好多次的回文的性質，這裡就用暴力法先來思考以下。
暴力法 (TLE)
1095. Find in Mountain Array
1095. Find in Mountain Array
19. Remove Nth Node From End of List
19. Remove Nth Node From End of List
這一題我的第一個想法是我先走一趟算出整個 Linked
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 中插入一個點，