Problem description: Visit and Support LintCode Search via Difficulty: Hard Tags: LintCode, Stack, O(n), Hard, Descending Stack ProblemSolutionCodeProblem