|
1 | 1 | package leetcode2018; |
2 | 2 |
|
3 | | -import java.util.Collections; |
4 | | -import java.util.PriorityQueue; |
| 3 | +import java.util.HashMap; |
| 4 | +import java.util.Map; |
5 | 5 |
|
6 | 6 | public class RelativeRanks { |
7 | 7 |
|
8 | 8 | public String[] findRelativeRanks(int[] nums) { |
9 | | - PriorityQueue<Integer> q = new PriorityQueue<>(10, Collections.reverseOrder()); |
10 | | - for(int i : nums){ |
11 | | - q.offer(i); |
| 9 | + Map<Integer,String> map = new HashMap<>(); |
| 10 | + String[] str = new String[nums.length]; |
| 11 | + int n = nums.length-1; |
| 12 | + int[] copy = new int[n+1]; |
| 13 | + for(int i=0; i<= n; i++){ |
| 14 | + copy[i]= nums[i]; |
| 15 | + } |
| 16 | + mergeSort(nums, 0, nums.length-1); |
| 17 | + for(int i=0; i< nums.length; i++){ |
| 18 | + if(i==0){ |
| 19 | + map.put(nums[n-i], "Gold Medal"); |
| 20 | + } |
| 21 | + else if(i==1){ |
| 22 | + map.put(nums[n-i], "Silver Medal"); |
| 23 | + } |
| 24 | + else if(i==2){ |
| 25 | + map.put(nums[n-i], "Bronze Medal"); |
| 26 | + } |
| 27 | + else{ |
| 28 | + map.put(nums[n-i], (i+1)+""); |
| 29 | + } |
| 30 | + } |
| 31 | + for(int i=0; i< copy.length; i++){ |
| 32 | + str[i] = map.get(copy[i]); |
| 33 | + } |
| 34 | + return str; |
| 35 | + } |
| 36 | + |
| 37 | + public void mergeSort(int[] nums, int l, int p){ |
| 38 | + if(l==p){ |
| 39 | + return; |
| 40 | + } |
| 41 | + int mid = (l+p)/2; |
| 42 | + mergeSort(nums, l, mid); |
| 43 | + mergeSort(nums, mid+1, p); |
| 44 | + merge(nums, l, mid+1, p); |
| 45 | + } |
| 46 | + |
| 47 | + public void merge(int[] nums, int left, int mid, int rightEnd){ |
| 48 | + int right = mid; |
| 49 | + int k=0; |
| 50 | + int n= rightEnd-left+1; |
| 51 | + int lower =left; |
| 52 | + int[] temp= new int[n]; |
| 53 | + while(left<=mid-1 && right<= rightEnd){ |
| 54 | + if(nums[left]<=nums[right]){ |
| 55 | + temp[k++]= nums[left++]; |
| 56 | + }else{ |
| 57 | + temp[k++]= nums[right++]; |
| 58 | + } |
| 59 | + } |
| 60 | + while(left<=mid-1){ |
| 61 | + temp[k++]= nums[left++]; |
| 62 | + } |
| 63 | + while(right<=rightEnd){ |
| 64 | + temp[k++]= nums[right++]; |
12 | 65 | } |
13 | 66 |
|
14 | | - int i=0; |
15 | | - String[] s = new String[nums.length]; |
16 | | - Integer val=null; |
17 | | - while( (val = q.poll()) != null) { |
18 | | - if(i==0) |
19 | | - s[i]="Gold Medal"; |
20 | | - if(i==1) |
21 | | - s[i]="Silver Medal"; |
22 | | - if(i==2) |
23 | | - s[i]="Bronze Medal"; |
24 | | - else |
25 | | - s[i]=val+""; |
26 | | - i++; |
27 | | - |
| 67 | + for(int i=0; i<n;i++){ |
| 68 | + nums[lower+i] = temp[i]; |
28 | 69 | } |
29 | | - returns; |
| 70 | + |
30 | 71 | } |
| 72 | + |
31 | 73 | } |
0 commit comments