목록팰린드롬 (1)

넘치게 채우기

[LeetCode] 5. Longest Palindromic Substring

https://leetcode.com/problems/longest-palindromic-substring/ = 0 && right < s.size() && s[left] == s[right]) { left--; right++; } return right - left - 1; } string longestPalindrome(string s) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const int n = s.size(); int maxLen = 0; int start = 0; for (int i = 0; i < n; i++) { int len1 = expandAroundCenter(s, i, i); int len2 = expandAroundC..
PS/LeetCode 2023. 10. 27. 14:41
이전 Prev 1 Next 다음