📖
LeetCode
Ctrlk
  • Introduction
  • Array
  • Basic Knowledge
  • Binary Search
  • Binary Tree
  • Bit
  • Data Structure
  • Divide Conquer
  • Dynamic Programming
    • 1.position
    • 2.sequence
    • Backpack Problem
    • 区间型
      • 1000.Minimum-Cost-to-Merge-Stones
      • 1335.Minimum-Difficulty-of-a-Job-Schedule
      • 375.Guess-Number-Higher-or-Lower-II
      • 87.Scramble-String
      • Coins In A Line Iii
    • 矩阵坐标
    • 1049.Last-Stone-Weight-II
    • 1140.Stone-Game-II
    • 1235.Maximum-Profit-in-Job-Scheduling
    • 1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
    • 1406.Stone-Game-III
    • 774.Minimize-Max-Distance-to-Gas-Station
    • Longest Arithmetic Sequence
  • Graph Search
  • Linked List
  • Matrix
  • Mergesort
  • Numbers
  • Other
  • Permutation And Combination
  • Queue
  • Sort Algorithm
  • Stack
  • String
  • Toposort
  • Trie Tree
  • Two Pointers
  • Union Find
Powered by GitBook
On this page

Was this helpful?

  1. Dynamic Programming

区间型

1000.Minimum-Cost-to-Merge-Stones1335.Minimum-Difficulty-of-a-Job-Schedule375.Guess-Number-Higher-or-Lower-II87.Scramble-StringCoins In A Line Iii
PreviousBackpackNext1000.Minimum-Cost-to-Merge-Stones

Last updated 4 years ago

Was this helpful?