Package g0401_0500.s0409_longest_palindrome

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    409 - Longest Palindrome.

    Easy

    Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.

    Letters are case sensitive , for example, "Aa" is not considered a palindrome here.

    Example 1:

    Input: s = "abccccdd"

    Output: 7

    Explanation: One longest palindrome that can be built is "dccaccd", whose length is 7.

    Example 2:

    Input: s = "a"

    Output: 1

    Explanation: The longest palindrome that can be built is "a", whose length is 1.

    Constraints:

    • 1 <= s.length <= 2000

    • s consists of lowercase and/or uppercase English letters only.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer longestPalindrome(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait