Commit5b05d77

committed

refactor 633

1 parent8d106db commit5b05d77Copy full SHA for 5b05d77

File tree

+19

-15

lines changed

+19

-15

lines changed

Lines changed: 19 additions & 15 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,8 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`	`3`	`/**`
	`4`	`+ * 633. Sum of Square Numbers`
	`5`	`+ *`
`4`	`6`	`* Given a non-negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c.`
`5`	`7`
`6`	`8`	`Example 1:`
`@@ -13,22 +15,24 @@`
`13`	`15`	`Output: False`
`14`	`16`	`*/`
`15`	`17`	`publicclass_633 {`
`16`		`-publicbooleanjudgeSquareSum(intc) {`
`17`		`-if (c <0) {`
`18`		`-returnfalse;`
`19`		`- }`
`20`		`-intleft =0;`
`21`		`-intright = (int) (Math.sqrt(c));`
`22`		`-while (left <=right) {`
`23`		`-intcurr =left left +right right;`
`24`		`-if (curr >c) {`
`25`		`-right--;`
`26`		`- }elseif (curr <c) {`
`27`		`-left++;`
`28`		`- }else {`
`29`		`-returntrue;`
	`18`	`+publicstaticclassSolution1 {`
	`19`	`+publicbooleanjudgeSquareSum(intc) {`
	`20`	`+if (c <0) {`
	`21`	`+returnfalse;`
`30`	`22`	`}`
	`23`	`+intleft =0;`
	`24`	`+intright = (int) (Math.sqrt(c));`
	`25`	`+while (left <=right) {`
	`26`	`+intcurr =left left +right right;`
	`27`	`+if (curr >c) {`
	`28`	`+right--;`
	`29`	`+ }elseif (curr <c) {`
	`30`	`+left++;`
	`31`	`+ }else {`
	`32`	`+returntrue;`
	`33`	`+ }`
	`34`	`+ }`
	`35`	`+returnfalse;`
`31`	`36`	`}`
`32`		`-returnfalse;`
`33`	`37`	`}`
`34`	`38`	`}`

Comments

(0)