摘要: 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).Example 1:Input: [3, 2, 1] Out... 阅读全文
posted @ 2017-08-05 19:56 xiejunzhao 阅读(227) 评论(0) 推荐(0)