Commit0fcd76a

committed

Added 2 solutions

1 parent7e9c8e4 commit0fcd76aCopy full SHA for 0fcd76a

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+classSolution {`
	`2`	`+publicintmaxNumberOfApples(int[]arr) {`
	`3`	`+Arrays.sort(arr);`
	`4`	`+inttotal =0;`
	`5`	`+intcount =0;`
	`6`	`+for (inti =0;i <arr.length;i++) {`
	`7`	`+total +=arr[i];`
	`8`	`+if (total >5000) {`
	`9`	`+break;`
	`10`	`+ }`
	`11`	`+count++;`
	`12`	`+ }`
	`13`	`+returncount;`
	`14`	`+ }`
	`15`	`+}`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,16 @@`
	`1`	`+classSolution {`
	`2`	`+publicList<List<Integer>>minimumAbsDifference(int[]arr) {`
	`3`	`+Arrays.sort(arr);`
	`4`	`+intminDiff =arr[1] -arr[0];`
	`5`	`+for (inti =2;i <arr.length;i++) {`
	`6`	`+minDiff =Math.min(minDiff,arr[i] -arr[i -1]);`
	`7`	`+ }`
	`8`	`+List<List<Integer>>ans =newArrayList<>();`
	`9`	`+for (inti =1;i <arr.length;i++) {`
	`10`	`+if (arr[i] -arr[i -1] ==minDiff) {`
	`11`	`+ans.add(Arrays.asList(arr[i -1],arr[i]));`
	`12`	`+ }`
	`13`	`+ }`
	`14`	`+returnans;`
	`15`	`+ }`
	`16`	`+}`

Comments

(0)