Third Maximum Number
来源:互联网 发布:linux上svn创建项目 编辑:程序博客网 时间:2024/06/05 21:03
题目: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: 1Explanation: The third maximum is 1.
Example 2:
Input: [1, 2]Output: 2Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
Example 3:
Input: [2, 2, 3, 1]Output: 1Explanation: Note that the third maximum here means the third maximum distinct number.Both numbers with value 2 are both considered as second maximum.
solution1:维护三个变量,分别保存最大数,次大数和第三大的数。遍历数组不断更新这三个数。遇到的问题,三个变量应该初始化成多少。
solution2:用STL中的set容器,自动去重和排序功能。(但是不知道为啥下面这个代码没有通过编译)
class Solution {public: int thirdMax(vector<int>& nums) { int n=nums.size(); set<int,greater<int>> s; for(int i=0;i<n;i++) { s.insert(nums[i]); } set<int>::iterator iter=s.begin(); if(s.size()>=3); { iter--; iter--; } return *iter; }};
0 0
- 414. Third Maximum Number
- LeetCode Third Maximum Number
- Leetcode414. Third Maximum Number
- 414. Third Maximum Number
- 414. Third Maximum Number
- LeetCode-Third Maximum Number
- leetcode414. Third Maximum Number
- 414. Third Maximum Number
- 414. Third Maximum Number
- Third Maximum Number
- 414. Third Maximum Number
- LeetCode414 Third Maximum Number
- 414. Third Maximum Number
- 414. Third Maximum Number
- 414. Third Maximum Number
- leetcode414: Third Maximum Number
- Third Maximum Number
- 414. Third Maximum Number
- iOS学习笔记之View
- MSIL简介
- 安卓——开发环境搭建(eclipse)
- cf311B(斜率优化)
- hdu1394 求最小逆序数
- Third Maximum Number
- 今日做的两道题
- 微信小程序入门Cookbook-1(不定期更新)
- oracle数据库_实例_用户_表空间之间的关系
- Ecshop模板开发(八):商品详情页赠送积分实现
- 鲁棒性(Robust,即健壮性)
- 快速排序
- c++-STL:删除子串
- 1到n全排列的真正复杂度