OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
    • 走格
      • 119. Pascal's Triangle II
      • Unique Paths
      • Unique Paths II
      • Climbing Stairs
      • 64. Minimum Path Sum
      • 741. Cherry Pickup
      • Knight Probability in Chessboard
      • Triangle
      • 221. Maximal Square
      • Bomb Enemy
      • 935. Knight Dialer
      • 174. Dungeon Game
      • 818. Race Car
      • 329. Longest Increasing Path in a Matrix
      • 403. Frog Jump
      • 568. Maximum Vacation Days
      • 1344. Jump Game V
    • 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
    • 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

走格

119. Pascal's Triangle IIUnique PathsUnique Paths IIClimbing Stairs64. Minimum Path Sum741. Cherry PickupKnight Probability in ChessboardTriangle221. Maximal SquareBomb Enemy935. Knight Dialer174. Dungeon Game818. Race Car329. Longest Increasing Path in a Matrix403. Frog Jump568. Maximum Vacation Days1344. Jump Game V
PreviousDynamic Programming INext119. Pascal's Triangle II

Last updated 6 years ago

Was this helpful?