[leetcode]Maximum Gap
来源:互联网 发布:新版淘宝怎么买电影票 编辑:程序博客网 时间:2024/05/10 06:29
问题描述:
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
Try to solve it in linear time/space.
Return 0 if the array contains less than 2 elements.
You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
代码:
int maximumGap(vector<int> &num) { //C++ if( num.size() <2) return 0; map<int,int> myMap; for(int i=0; i<num.size(); i++) myMap.insert(make_pair(num[i],i)); int pos =1,max=0,dif,temp; map<int,int>::iterator iter=myMap.begin(); temp = iter->first; iter++; for(; iter!=myMap.end(); iter++) { dif = abs(iter->first-temp); if(dif >max) max = dif; temp = iter->first; } return max; }
0 0
- leetcode-Maximum Gap
- [LeetCode] Maximum Gap
- LeetCode Maximum Gap
- [leetCode] Maximum Gap
- leetcode 155: Maximum Gap
- LeetCode(164) Maximum Gap
- [LeetCode] Maximum Gap
- [leetcode 164] Maximum Gap
- [leetcode]Maximum Gap
- LeetCode - Maximum Gap 题解
- Maximum Gap|leetcode题解
- LeetCode[Sort]: Maximum Gap
- [LeetCode] Maximum Gap
- leetcode maximum gap
- [LeetCode]Maximum Gap
- LeetCode OJ Maximum Gap
- LeetCode Maximum Gap
- 【leetcode】 Maximum Gap
- python进阶教程之异常处理
- 由二叉树的前序遍历和中序遍历来求后序遍历的结果
- socket, nio socket 及nio socket框架MINA总结
- 用R语言预测鱼塘鱼尾的长度
- kernel 调试之——dump_stack
- [leetcode]Maximum Gap
- Python指南--错误和异常
- redo undo buffer cache
- C语言学习中。。。
- [math][第二阶段-easy math][HDU-1713]相遇周期
- 常量指针
- Object类型数据转为int型数据
- mysql 主键自增长并且设置默认值
- Testing TokuDB – Faster and smaller for large tables