本文共 353 字,大约阅读时间需要 1 分钟。
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).
转载地址:http://phdvi.baihongyu.com/