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