Commitd97bac8

committed

refactor 977

1 parentb29a5e9 commitd97bac8Copy full SHA for d97bac8

File tree

-28

lines changed

-28

lines changed

Lines changed: 9 additions & 28 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,34 +2,15 @@`
`2`	`2`
`3`	`3`	`importjava.util.Arrays;`
`4`	`4`
`5`		`-/**`
`6`		`- * 977. Squares of a Sorted Array`
`7`		`- *`
`8`		`- * Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.`
`9`		`- *`
`10`		`- * Example 1:`
`11`		`- * Input: [-4,-1,0,3,10]`
`12`		`- * Output: [0,1,9,16,100]`
`13`		`- *`
`14`		`- * Example 2:`
`15`		`- * Input: [-7,-3,2,3,11]`
`16`		`- * Output: [4,9,9,49,121]`
`17`		`- *`
`18`		`- *`
`19`		`- * Note:`
`20`		`- * 1 <= A.length <= 10000`
`21`		`- * -10000 <= A[i] <= 10000`
`22`		`- * A is sorted in non-decreasing order.`
`23`		`- */`
`24`	`5`	`publicclass_977 {`
`25`		`-publicstaticclassSolution1 {`
`26`		`-publicint[]sortedSquares(int[]A) {`
`27`		`-int[]result =newint[A.length];`
`28`		`-for (inti =0;i <A.length;i++) {`
`29`		`-result[i] = (int)Math.pow(A[i],2);`
`30`		`- }`
`31`		`-Arrays.sort(result);`
`32`		`-returnresult;`
	`6`	`+publicstaticclassSolution1 {`
	`7`	`+publicint[]sortedSquares(int[]A) {`
	`8`	`+int[]result =newint[A.length];`
	`9`	`+for (inti =0;i <A.length;i++) {`
	`10`	`+result[i] = (int)Math.pow(A[i],2);`
	`11`	`+ }`
	`12`	`+Arrays.sort(result);`
	`13`	`+returnresult;`
	`14`	`+ }`
`33`	`15`	`}`
`34`		`- }`
`35`	`16`	`}`

Comments

(0)