Big Data - Machine Learning, Algorithms and Data Structures

little strokes fell great oaks.

Wednesday, June 30, 2021

LintCode 76 · Longest Increasing Subsequence

The dp: function is
dp[i] = Math.max(dp[i], dp[l] + 1);
Posted by bigdataoliver at 10:51 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: DP-Solitaire, DP/ Dynamic Programming, LintCode

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

About Me

bigdataoliver
View my complete profile

Blog Archive

  • ▼  2021 (59)
    • ►  August (5)
    • ►  July (44)
    • ▼  June (10)
      • LintCode 801 · Backpack X.java
      • LintCode 799 · Backpack VIII.java
      • LintCode 798 · Backpack VII.java
      • LintCode 564 · Combination Sum IV.java
      • LintCode 563 · Backpack V.java
      • LintCode 562 · Backpack IV.java
      • LintCode 440 · Backpack III.java
      • LintCode 125 · Backpack II.java
      • LintCode 92 · Backpack
      • LintCode 76 · Longest Increasing Subsequence
  • ►  2019 (15)
    • ►  February (11)
    • ►  January (4)
  • ►  2018 (40)
    • ►  May (1)
    • ►  April (2)
    • ►  March (6)
    • ►  February (12)
    • ►  January (19)
  • ►  2016 (3)
    • ►  September (3)
Picture Window theme. Powered by Blogger.