1610. Maximum Number of Visible Points
1610. Maximum Number of Visible Points
class Solution:
def visiblePoints(
Two Pointers
2000. Reverse Prefix of Word
2000. Reverse Prefix of Word
class Solution:
def reversePrefix(self,
2540. Minimum Common Value
2540. Minimum Common Value
class Solution:
def getCommon(self, nums1:
244. Shortest Word Distance II
244. Shortest Word Distance II
參考： 243. Shortest Word Distance
870. Advantage Shuffle
870. Advantage Shuffle
class Solution:
def advantageCount(self, nums1: List[
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)