java
Amberwin
这个作者很懒,什么都没留下…
展开
-
【java】496. Next Greater Element I
问题链接https://leetcode-cn.com/problems/next-greater-element-i/description/ public int[] nextGreaterElement(int[] nums1, int[] nums2) { int[] res = new int[nums1.length]; Map<Intege...原创 2018-07-25 11:56:45 · 313 阅读 · 0 评论 -
【java】快速排序
public void quickSort(int[] nums,int left,int right) { if(left>=right) return; int key = nums[left]; int i = left; int j = right; while(i<j) { if(nums[j]<key) { if(nums[i]&g...原创 2018-07-20 15:57:32 · 112 阅读 · 0 评论 -
【java】在无序数组中寻找Kth大元素
public int portition(int[] nums,int left,int right) { int key = nums[left]; int i = left; int j = right; while(i<j) { if(nums[j]>key) { if(nums[i]<key) { int tmp = nums[...原创 2018-07-20 16:27:28 · 481 阅读 · 0 评论