Leetcode之Third Maximum Number 问题

问题描述： Given a non-empty array of integers, return the third maximum number in this array.If it does not exist, return the maximum number. The time complexity must be in O(n). 示例一: Input: [3, 2, 1] Out

>>阅读原文<<