GoLang Solution For LeetCode Problem: Longest Palindrome
Solving Longest Palindrome in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
**Note:**Assume the length of given string will not exceed 1,010.
Example:
Input:
"abccccdd"
Output:
7
Explanation:
One longest palindrome that can be built is "dccaccd", whose length is 7.
See the full details of the problem Longest Palindrome at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.