OJ
CtrlK
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
    • 走格
    • Subsequence
    • Counting Bits
    • 887. Super Egg Drop
    • 674. Longest Continuous Increasing Subsequence
    • Integer Break
    • Catalan Number
    • Count Numbers with Unique Digits
    • 2 Keys Keyboard
    • 背包问题
    • DFS + Memorization
    • Palindromic Strings
    • 多状态DP
      • Best Time to Buy and Sell Stock
      • Best Time to Buy and Sell Stock with Cooldown
      • Maximum Product Subarray
      • Paint Fence
      • Best Time to Buy and Sell Stock with Transaction Fee
      • Best Time to Buy and Sell Stock IV
      • 975. Odd Even Jump
      • 801. Minimum Swaps To Make Sequences Increasing
      • 552. Student Attendance Record II
    • f长度与input array长度无关
    • 多指针
    • Partition
    • Subarray Sum
    • String Match
    • Game Theory
    • Flip String to Monotone Increasing
    • 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
    • Maximum Rectangle
    • 1513. Number of Substrings With Only 1s
    • 哈密顿图
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Dynamic Programming I

多状态DP

Best Time to Buy and Sell StockBest Time to Buy and Sell Stock with CooldownMaximum Product SubarrayPaint FenceBest Time to Buy and Sell Stock with Transaction FeeBest Time to Buy and Sell Stock IV975. Odd Even Jump801. Minimum Swaps To Make Sequences Increasing552. Student Attendance Record II
PreviousPalindrome Partitioning IINextBest Time to Buy and Sell Stock

Last updated 6 years ago

Was this helpful?