Commit6628e86

authored

Merge pull requestneetcode-gh#3321 from adhamahmad/adham-branch

Create: 1968-array-with-elements-not-equal-to-average-of-neighbors.java, 0658-find-k-closest-elements.java

2 parents1aa28bf +6166683 commit6628e86Copy full SHA for 6628e86

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+classSolution {`
	`2`	`+publicList<Integer>findClosestElements(int[]arr,intk,intx) {`
	`3`	`+intl =0;`
	`4`	`+intr =arr.length -k;`
	`5`	`+List<Integer>result =newArrayList<>();`
	`6`	`+while(l <r){`
	`7`	`+intm = (l+r) /2;`
	`8`	`+if(x -arr[m] >arr[m+k] -x ){//right is closer`
	`9`	`+l =m+1;`
	`10`	`+ }else{//left is closer`
	`11`	`+r =m;`
	`12`	`+ }`
	`13`	`+ }`
	`14`	`+for(inti =l;i <l+k;i++){//build the solution list`
	`15`	`+result.add(arr[i]);`
	`16`	`+ }`
	`17`	`+returnresult;`
	`18`	`+ }`
	`19`	`+}`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+classSolution {`
	`2`	`+publicint[]rearrangeArray(int[]nums) {`
	`3`	`+for(inti=1;i <=nums.length-2;i++){`
	`4`	`+if( ( (nums[i-1] <nums[i] &&nums[i] <nums[i+1] ) \|\| (nums[i-1] >nums[i] &&nums[i] >nums[i+1] ) )){//swap`
	`5`	`+inttemp =nums[i+1];`
	`6`	`+nums[i+1] =nums[i];`
	`7`	`+nums[i] =temp;`
	`8`	`+ }`
	`9`	`+ }`
	`10`	`+returnnums;`
	`11`	`+ }`
	`12`	`+}`

Comments

(0)