Commit e8b22a7

committed

Relative Ranks

1 parent 2e7f588 commit e8b22a7Copy full SHA for e8b22a7

File tree

+10

-10

lines changed

+10

-10

lines changed

Lines changed: 10 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -17,22 +17,22 @@ public String[] findRelativeRanks(int[] nums) {`
`17`	`17`	`for(int i=0; i< nums.length; i++){`
`18`	`18`	`if(i==0){`
`19`	`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)+"");`
	`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`	`29`	`}`
`30`	`30`	`}`
`31`	`31`	`for(int i=0; i< copy.length; i++){`
`32`	`32`	`str[i] = map.get(copy[i]);`
`33`	`33`	`}`
`34`	`34`	`return str;`
`35`		`-}`
	`35`	`+}`
`36`	`36`
`37`	`37`	`public void mergeSort(int[] nums, int l, int p){`
`38`	`38`	`if(l==p){`

Comments

(0)