<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                合規國際互聯網加速 OSASE為企業客戶提供高速穩定SD-WAN國際加速解決方案。 廣告
                ## Leetcode # (重要)本站暫停更新,正在遷移至github pages -> [omretterry.github.io](https://omretterry.github.io) > Terry Li 的Leetcode刷題之路 > **Tips:** > * 題目名稱 &rarr; leetcode對應題目頁面 > * 查看按鈕 &rarr; 對應解題 ### 簡介 * [個人簡介](./profile.md) * [Leetcode主頁](https://leetcode-cn.com/u/terryli/) ### 題目列表 ##### 周賽專題 > 周賽、雙周賽筆記 ;也許會不完整,做不出來的題目后面慢慢補上(弱雞的掙扎) [&rarr; 點我前往](./contest/contest.md) ##### 線性數據結構(數組,棧,隊列,鏈表) | 編號 | 名稱 | 難度 |標簽| 操作 | | --- | --- | --- | --- | --- | |9|[回文數](https://leetcode-cn.com/problems/palindrome-number/)|Easy|數學|[查看](./liner-data-structure/palindrome-number.md)| |1431|[擁有最多糖果的孩子](https://leetcode-cn.com/problems/kids-with-the-greatest-number-of-candies/)|Easy||[查看](./liner-data-structure/kids-with-the-greatest-number-of-candies.md)| |14|[最長公共前綴](https://leetcode-cn.com/problems/longest-common-prefix/)|Easy||[查看](./liner-data-structure/longest-common-prefix.md)| |面試題.64|[求1+2+…+n](https://leetcode-cn.com/problems/qiu-12n-lcof/)|Easy||[查看](./liner-data-structure/qiu-12n-lcof.md)| |238|[除自身以外數組的乘積](https://leetcode-cn.com/problems/product-of-array-except-self/)|Medium||[查看](./liner-data-structure/product-of-array-except-self.md)| |46|[全排列](https://leetcode-cn.com/problems/permutations/)|Medium|遞歸, 回溯|[查看](./liner-data-structure/permutations.md)| |739|[每日溫度](https://leetcode-cn.com/problems/daily-temperatures/)|Medium|單調棧|[查看](./liner-data-structure/daily-temperatures.md)| |1300|[轉變數組后最接近目標值的數組和](https://leetcode-cn.com/problems/sum-of-mutated-array-closest-to-target/)|Medium|二分法|[查看](./liner-data-structure/sum-of-mutated-array-closest-to-target.md)| ##### 非線性數據結構(樹,圖,多維數組) | 編號 | 名稱 | 難度 | 標簽 | 操作 | | --- | --- | --- | --- | --- | |111|[二叉樹的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/)|Easy|BFS|[查看](./nonliner-data-structure/minimum-depth-of-binary-tree.md)| |965|[單值二叉樹](https://leetcode-cn.com/problems/univalued-binary-tree/)|Easy|DFS|[查看](./nonliner-data-structure/univalued-binary-tree.md)| |面試題29|[順時針打印矩陣](https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/)|Easy||[查看](./nonliner-data-structure/shun-shi-zhen-da-yin-ju-zhen-lcof.md)| |990|[等式方程的可滿足性](https://leetcode-cn.com/problems/satisfiability-of-equality-equations/)|Medium|并查集|[查看](./nonliner-data-structure/satisfiability-of-equality-equations.md)| |743|[網絡延遲時間](https://leetcode-cn.com/problems/network-delay-time/)|Medium|鄰接表,Dijkstra算法|[查看](./nonliner-data-structure/network-delay-time.md)| |126|[單詞接龍 II](https://leetcode-cn.com/problems/word-ladder-ii/)|Hard|鄰接表,雙向BFS|[查看](./nonliner-data-structure/word-ladder-ii.md) ##### 動態規劃 | 編號 | 名稱 | 難度 | 操作 | | --- | --- | --- | --- | |198|[打家劫舍](https://leetcode-cn.com/problems/house-robber/)|Easy|[查看](./dp/house-robber.md)| |837|[新21點](https://leetcode-cn.com/problems/new-21-game/)|Medium|[查看](./dp/new-21-game.md)| |面試題46|[把數字翻譯成字符串](https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/)|Medium|[查看](./dp/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md)| ##### 其他 | 編號 | 名稱 | 難度 | 操作 | | --- | --- | --- | --- | |171|[Excel表列序號](https://leetcode-cn.com/problems/excel-sheet-column-number/)|Easy|[查看](./other/excel-sheet-column-number.md)| |29|[兩數相除](https://leetcode-cn.com/problems/divide-two-integers/)|Medium|[查看](./other/divide-two-integers.md)| |166|[分數到小數](https://leetcode-cn.com/problems/fraction-to-recurring-decimal/)|Medium|[查看](./other/fraction-to-recurring-decimal.md)|
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看