136. Palindrome Partitioning
!!!写判断字符串是否是回文串的函数忘记i++,j--;
1 private boolean palindrome(String s) { 2 int i = 0; 3 int j = s.length() - 1; 4 while (i <= j) { 5 if (s.charAt(i) != s.charAt(j)) { 6 return false; 7 } 8 i++; 9 j--; 10 } 11 return true; 12 }