본문 바로가기

0/leetcode

5. Longest Palindromic Substring

1. There can be two scenarios. Odd and even number.

2. Start from center and expand to left and right.

3. Compare with the previous string length.

반응형

'0 > leetcode' 카테고리의 다른 글

39. Combination Sum  (0) 2026.03.22
33. Search in Rotated Sorted Array  (0) 2026.03.22
53. Maximum Subarray 풀이  (0) 2020.11.18
139. Word Break 풀이  (0) 2020.11.17
5. Longest Palindromic Substring 풀이  (0) 2020.11.11