Commit ecc2f8f

authored

Create Solution.java

1 parent e090c2e commit ecc2f8fCopy full SHA for ecc2f8f

File tree

+32

-0

lines changed

+32

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+class Solution {`
	`2`	`+ public int longestDecomposition(String text) {`
	`3`	`+ char[] cs = text.toCharArray();`
	`4`	`+ int res = 0;`
	`5`	`+ for (int i = 0, j = cs.length - 1; i <= j; ) {`
	`6`	`+ boolean flag = true;`
	`7`	`+ for (int k = 1; i + k - 1 < j - k + 1; ++k) {`
	`8`	`+ if (check(cs, i, j - k + 1, k)) {`
	`9`	`+ res += 2;`
	`10`	`+ i += k;`
	`11`	`+ j -= k;`
	`12`	`+ flag = false;`
	`13`	`+ break;`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+ if (flag) {`
	`17`	`+ ++res;`
	`18`	`+ break;`
	`19`	`+ }`
	`20`	`+ }`
	`21`	`+ return res;`
	`22`	`+ }`
	`23`	`+`
	`24`	`+ private boolean check(char[] cs, int i, int j, int k) {`
	`25`	`+ while (k-- > 0) {`
	`26`	`+ if (cs[i++] != cs[j++]) {`
	`27`	`+ return false;`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+ return true;`
	`31`	`+ }`
	`32`	`+}`

Comments

(0)