Advertisement
Guest User

Untitled

a guest
Jun 18th, 2019
69
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.42 KB | None | 0 0
  1. public String longestPalindromeExpandAroundCenter(String s) {
  2. if (s == null || s.length() < 1) return "";
  3. int start = 0, end = 0;
  4. for (int i = 0; i < s.length(); i++) {
  5. int len1 = expandAroundCenter(s, i, i);
  6. int len2 = expandAroundCenter(s, i, i + 1);
  7. int len = Math.max(len1, len2);
  8. if (len > end - start) {
  9. start = i - (len - 1) / 2;
  10. end = i + len / 2;
  11. }
  12. }
  13. return s.substring(start, end + 1);
  14. }
  15.  
  16. private int expandAroundCenter(String s, int left, int right) {
  17. int L = left, R = right;
  18. while (L >= 0 && R < s.length() && s.charAt(L) == s.charAt(R)) {
  19. L--;
  20. R++;
  21. }
  22. return R - L - 1;
  23. }
  24.  
  25. var longestPalindrome = function (s) {
  26. if (s == null || s.length < 1) return "";
  27. var start = 0, end = 0;
  28. for (var i = 0; i < s.length; i++) {
  29. var len1 = expandAroundCenter(s, i, i);
  30. var len2 = expandAroundCenter(s, i, i + 1);
  31. var len = Math.max(len1, len2);
  32. if (len > end - start) {
  33. start = i - (len - 1) / 2;
  34. end = i + len / 2;
  35. }
  36. }
  37. return s.substring(start, end + 1);
  38. };
  39. var expandAroundCenter = function (s, left, right) {
  40. var L = left, R = right;
  41. while (L >= 0 && R < s.length && s[L] == s[R]) {
  42. L--;
  43. R++;
  44. }
  45. return R - L - 1;
  46. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement