1650. Lowest Common Ancestor of a Binary Tree III 1650. Lowest Common Ancestor of a Binary Tree III Check
1644. Lowest Common Ancestor of a Binary Tree II 1644. Lowest Common Ancestor of a Binary Tree II Check
235. Lowest Common Ancestor of a Binary Search Tree * 235. Lowest Common Ancestor of a Binary Search Tree * 236.
5. Longest Palindromic Substring 5. Longest Palindromic Substring 這一題是我們要找出子字串中的最長的回文,其實最好從暴力解法開始學習起,前面的題目已經重複提過了好多次的回文的性質,這裡就用暴力法先來思考以下。 暴力法 (TLE)
490. The Maze 490. The Maze 這一個題目可以使用廣度優先搜索來解,這一個題目的困難是在於要如何理解球的運動方向。 一般而言廣度優先搜索的探索步伐是一部,可是這個題目裡面,球會滾到撞牆為止,所以當我在座標 (row,