array(2) { ["docs"]=> array(0) { } ["count"]=> int(0) } 111string(0) "" int(1) int(10) int(70) int(8640000) string(13) "likecs_art_db" array(1) { ["query"]=> array(1) { ["match_all"]=> object(stdClass)#28 (0) { } } } array(1) { ["createtime.keyword"]=> array(1) { ["order"]=> string(4) "desc" } } int(10) int(0) int(8640000) array(2) { ["docs"]=> array(0) { } ["count"]=> int(0) } 九章算法题目 - 爱码网

DP:

Matrix DP: 1.K Sum
                2.trigle
                3.最小路径和      Minimum Path Sum(leetcode)
                4.不同路径     Unique Paths(leetcode) 
                5.不同路径II
Sequence DP:
                1.爬楼梯
                2.跳跃游戏      Jump Game(leetcode)
                3.跳跃游戏II      Jump Game II(leetcode)
                4.分割回文串II    Palindrome Partitioning II(leetcode)
                5.单词切分
                6.Longest Increasing Subsequence
Two Sequences DP:
                1.longest Common Subsequence
                2.longest Common Substring      leetcodel类似题目718
                3.Edit Distance
                4.Distinct Subsequence
                5.Interleaving String
Backpack:
                1.Backpack
                2.BackpackII
                3.K Sum
                4.Mininum Adjustment Cost

 

Binary Tree:

DFS: 1.Binary Tree Preorder Traversal
        2.Maximum Depth of Binary Tree
        3.Balanced Binary Tree
        4.Binary Tree Maximum Path Sum
        5.Lowest Common Ancestor
        6.Binary Tree DFS Template
BFS: 1.Binary Tree Level Order Traversal
        2.Binary Tree Level Order Traversal II
        3.Binary Tree Zigzag Level Order Traversal
        4.Binary Tree BFS Template
Binary Search Tree:
        1.Validate Binary Search Tree
        2.Insert a Node in Binary Search Tree
        3.Search Range In Binary Search Tree
        4.Implement Iterator of Binary Search Tree
        5.Remove Node In Binary Search Tree

 

相关文章: