Problem description: Visit and Support LintCode Search via Difficulty: Hard Tags: LintCode, Binary Search, O(m + n), O(1), Hard ProblemSolutionCodeProblem