题目
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). Given a non-e
阅读背景：
[C语言][LeetCode][414]Third Maximum Number_Timsley的专栏
来源：互联网
分享到：
