Problem description: Visit and Support LintCode Search via Difficulty: Easy Tags: LintCode, Dynamic Programming, O(n), O(1), Easy ProblemSolutionCodeProblem