Commit00d4878

committed

Added 3 medium solutions

1 parente71da8b commit00d4878Copy full SHA for 00d4878

File tree

+121

-9

lines changed

+121

-9

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,39 @@`
	`1`	`+classSolution {`
	`2`	`+publicstaticintfindPeakElement(int[]nums) {`
	`3`	`+if (nums.length ==1) {`
	`4`	`+return0;`
	`5`	`+ }`
	`6`	`+`
	`7`	`+returnfindPeakElementImpl(nums,0,nums.length-1);`
	`8`	`+ }`
	`9`	`+`
	`10`	`+privatestaticintfindPeakElementImpl(int[]nums,intstart,intend) {`
	`11`	`+if (start >end) {`
	`12`	`+return -1;`
	`13`	`+ }`
	`14`	`+`
	`15`	`+intmid = (start +end)/2;`
	`16`	`+`
	`17`	`+if (mid ==0 &&nums.length >1) {`
	`18`	`+if (nums[mid] >nums[mid+1]) {`
	`19`	`+returnmid;`
	`20`	`+ }`
	`21`	`+ }`
	`22`	`+elseif (mid ==nums.length-1 &&nums.length >1) {`
	`23`	`+if (nums[mid] >nums[mid-1]) {`
	`24`	`+returnmid;`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+else {`
	`28`	`+if (nums.length >1) {`
	`29`	`+if (nums[mid] >nums[mid-1] &&nums[mid] >nums[mid+1]) {`
	`30`	`+returnmid;`
	`31`	`+ }`
	`32`	`+ }`
	`33`	`+ }`
	`34`	`+`
	`35`	`+intleft =findPeakElementImpl(nums,start,mid-1);`
	`36`	`+`
	`37`	`+returnleft == -1 ?findPeakElementImpl(nums,mid+1,end) :left;`
	`38`	`+ }`
	`39`	`+}`

Lines changed: 14 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,18 @@`
`1`	`1`	`classSolution {`
`2`		`-publicintfindKthLargest(int[]nums,intk) {`
`3`		`-Arrays.sort(nums);`
`4`		`-inti =0;`
`5`		`-intj =nums.length;`
`6`		`-while (i<k) {`
`7`		`-i++;`
`8`		`-j--;`
	`2`	`+publicstaticintfindKthLargest(int[]nums,intk) {`
	`3`	`+PriorityQueue<Integer>queue =newPriorityQueue<>(k);`
	`4`	`+for (inti=0;i<nums.length;i++) {`
	`5`	`+if (queue.size() <k) {`
	`6`	`+queue.add(nums[i]);`
	`7`	`+ }`
	`8`	`+else {`
	`9`	`+if (nums[i] >queue.peek()) {`
	`10`	`+queue.remove();`
	`11`	`+queue.add(nums[i]);`
	`12`	`+ }`
	`13`	`+ }`
`9`	`14`	`}`
`10`		`-`
`11`		`-returnnums[j];`
	`15`	`+`
	`16`	`+returnqueue.remove();`
`12`	`17`	`}`
`13`	`18`	`}`

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,46 @@`
	`1`	`+classSolution {`
	`2`	`+publicstaticList<String>letterCombinations(Stringdigits) {`
	`3`	`+Map<Integer,String>map =newHashMap<>();`
	`4`	`+`
	`5`	`+map.put(2,"abc");`
	`6`	`+map.put(3,"def");`
	`7`	`+map.put(4,"ghi");`
	`8`	`+map.put(5,"jkl");`
	`9`	`+map.put(6,"mno");`
	`10`	`+map.put(7,"pqrs");`
	`11`	`+map.put(8,"tuv");`
	`12`	`+map.put(9,"wxyz");`
	`13`	`+`
	`14`	`+ArrayList<String>result =newArrayList<String>();`
	`15`	`+if(digits ==null \|\|digits.length() ==0) {`
	`16`	`+returnresult;`
	`17`	`+ }`
	`18`	`+`
	`19`	`+ArrayList<Character>temp =newArrayList<Character>();`
	`20`	`+updateResult(digits,temp,result,map);`
	`21`	`+`
	`22`	`+returnresult;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+privatestaticvoidupdateResult(Stringdigits,ArrayList<Character>temp,ArrayList<String>result,Map<Integer,String>map) {`
	`26`	`+if (digits.length() ==0) {`
	`27`	`+char[]charArray =newchar[temp.size()];`
	`28`	`+`
	`29`	`+for (inti=0;i<temp.size();i++) {`
	`30`	`+charArray[i] =temp.get(i);`
	`31`	`+ }`
	`32`	`+`
	`33`	`+result.add(String.valueOf(charArray));`
	`34`	`+return;`
	`35`	`+ }`
	`36`	`+`
	`37`	`+Integercurr =Integer.valueOf(digits.substring(0,1));`
	`38`	`+Stringletters =map.get(curr);`
	`39`	`+`
	`40`	`+for (inti=0;i<letters.length();i++) {`
	`41`	`+temp.add(letters.charAt(i));`
	`42`	`+updateResult(digits.substring(1),temp,result,map);`
	`43`	`+temp.remove(temp.size()-1);`
	`44`	`+ }`
	`45`	`+ }`
	`46`	`+}`

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,22 @@`
	`1`	`+classSolution {`
	`2`	`+`
	`3`	`+publicintuniquePaths(intm,intn) {`
	`4`	`+int[][]arr =newint[m][n];`
	`5`	`+returngetCount(arr,m,n);`
	`6`	`+ }`
	`7`	`+`
	`8`	`+privateintgetCount(int[][]arr,intm,intn) {`
	`9`	`+for (inti=0;i<arr.length;i++) {`
	`10`	`+for (intj=0;j<arr[0].length;j++) {`
	`11`	`+if (i ==0 \|\|j ==0) {`
	`12`	`+arr[i][j] =1;`
	`13`	`+ }`
	`14`	`+else {`
	`15`	`+arr[i][j] =arr[i-1][j] +arr[i][j-1];`
	`16`	`+ }`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+`
	`20`	`+returnarr[m-1][n-1];`
	`21`	`+ }`
	`22`	`+}`

Comments

(0)