zoukankan      html  css  js  c++  java
  • 414. 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).

    Example 1:

    Input: [3, 2, 1]
    
    Output: 1
    
    Explanation: The third maximum is 1.
    

    Example 2:

    Input: [1, 2]
    
    Output: 2
    
    Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
    

    Example 3:

    Input: [2, 2, 3, 1]
    
    Output: 1
    
    Explanation: Note that the third maximum here means the third maximum distinct number.
    Both numbers with value 2 are both considered as second maximum.

    求第3大的数,数组中有重复数字

    C++(6ms):

     1 class Solution {
     2 public:
     3     int thirdMax(vector<int>& nums) {
     4         set<int> res ;
     5         for(int i : nums){
     6             res.insert(i) ;
     7             if (res.size() > 3)
     8                 res.erase(res.begin()) ;
     9         }
    10         return res.size()==3?*res.begin():*res.rbegin() ;
    11     }
    12 };
  • 相关阅读:
    文件路径选择中的三态逻辑
    .net版本号
    使用MSBuild编译vs多个解决方案
    CEF截图
    使用SharpZIpLib写的压缩解压操作类
    软件试用期设置
    list转datatable
    excel 导入
    网站登录简单验证码
    UEditor编辑器
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/7609948.html
Copyright © 2011-2022 走看看