Commitbd7fead

authored

977_Squares_of_a_Sorted_Array.java

1 parent95c3a7e commitbd7feadCopy full SHA for bd7fead

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+classSolution {`
	`2`	`+/* public int[] sortedSquares(int[] A) {`
	`3`	`+ int[] res = new int[A.length];`
	`4`	`+ for (int i = 0; i < A.length; ++i)`
	`5`	`+ res[i] = A[i] * A[i];`
	`6`	`+`
	`7`	`+ Arrays.sort(res);`
	`8`	`+ return res;`
	`9`	`+ } */`
	`10`	`+publicint[]sortedSquares(int[]A) {`
	`11`	`+intpos =0;`
	`12`	`+int[]res =newint[A.length];`
	`13`	`+intcurr =0;`
	`14`	`+while (pos <A.length &&A[pos] <0)pos++;`
	`15`	`+intnpos =pos -1;`
	`16`	`+while (pos <A.length &&npos >=0) {`
	`17`	`+if (A[pos] A[pos] <A[npos] A[npos]) {`
	`18`	`+res[curr++] =A[pos] *A[pos];`
	`19`	`+pos++;`
	`20`	`+ }else {`
	`21`	`+res[curr++] =A[npos] *A[npos];`
	`22`	`+npos--;`
	`23`	`+ }`
	`24`	`+ }`
	`25`	`+while (npos >=0) {`
	`26`	`+res[curr++] =A[npos] *A[npos];`
	`27`	`+npos--;`
	`28`	`+ }`
	`29`	`+while (pos <A.length) {`
	`30`	`+res[curr++] =A[pos] *A[pos];`
	`31`	`+pos++;`
	`32`	`+ }`
	`33`	`+returnres;`
	`34`	`+ }`
	`35`	`+}`

Comments

(0)