Java-Maximum Gap
来源:互联网 发布:学编程看什么书 编辑:程序博客网 时间:2024/06/05 17:09
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.
Credits:
Special thanks to @porker2008 for adding this problem and creating all test cases.
给出乱序数组 要求排好序后相邻元素间的最大差值
由于要求是线性时间复杂度 所以所有内部排序方法都不可以用 只有用桶式排序()参考http://blog.csdn.net/apei830/article/details/6596057
代码如下:
public class Solution { public int maximumGap(int[] num) { if(num.length<2)return 0; int max=-1; int min=Integer.MAX_VALUE; int step=(max-min)/num.length+1; for(int i=0;i<num.length;i++){ if(num[i]>max)max=num[i]; if(num[i]<min)min=num[i]; } if(num.length==2)return max-min; int[] minxx=new int[num.length+1]; int[] maxxx=new int[num.length+1]; for(int i=0;i<num.length;i++){ int x = num[i]; int k = (int)(num.length * (1.0 * (x - min) / (max - min))); //attention! may have overflow problem! if(minxx[k]==0 || x<minxx[k]) minxx[k] = x; if(maxxx[k]==0 || x>maxxx[k]) maxxx[k] = x; } int maxInter = 0; min = maxxx[0]; for(int i=1; i<num.length+1; i++) { if(minxx[i] == 0) continue; maxInter = Math.max(maxInter, minxx[i] - min); min = maxxx[i]; } return maxInter; }}
0 0
- Java-Maximum Gap
- Maximum Gap (Java)
- LeetCode – Maximum Gap (Java)
- Maximum Gap
- Maximum Gap
- Maximum Gap
- MAXIMUM GAP
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- Maximum Gap
- python 笔记 在windows下的程序 获取图片并显示出来
- android登录功能
- c++_primer_exercise_1118
- 网球之球拍的材质及参数
- 深入理解内联inline函数的优缺点,性能及使用指南
- Java-Maximum Gap
- Python 第四章 字典:当索引不好用时
- 黑马程序员--Java基础知识总结
- C++ 面向对象编程 友元类成员函数
- 灵活使用XMultipleSeriesRenderer设置自定义的轴标签
- 最大子序列问题
- URL中字符串的编码及URL跳转
- Android开发:LayoutParams的用法
- Java_语法基础_Math.ceil() Math.floor() Math.round()