[LintCode] Longest Palindrome

nicercode 發布于2019-08-15 13:42 / 2580人閱讀

Problem

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

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

Notice

Assume the length of given string will not exceed 1010.

Example

Given s = "abccccdd" return 7

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

Solution

public class Solution {
    /*
     * @param s: a string which consists of lowercase or uppercase letters
     * @return: the length of the longest palindromes that can be built
     */
    public int longestPalindrome(String s) {
        // write your code here
        int res = 0;
        //Use HashMap to store occurrence, when it"s even, res adds 2 and map deletes the key
        Map map = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
            char ch = s.charAt(i);
            if (map.containsKey(ch)) {
                map.remove(ch);
                res += 2;
            } else {
                map.put(ch, 1);
            }
        }
        if (res < s.length()) res += 1;
        return res;
    }
}

GPU云服務器云服務器 Longest palindrome LintCode LintCode134_LRU

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://m.specialneedsforspecialkids.com/yun/68259.html

[LintCode/LeetCode] Longest Palindrome Substring

摘要：是左閉右開區間，所以要。，要理解是和之間只有一個元素。循環每次的時候，都要更新子串更大的情況。補一種中點延展的方法循環字符串的每個字符，以該字符為中心，若兩邊為回文，則向兩邊繼續延展。循環返回長度最長的回文串即可。 Problem Given a string S, find the longest palindromic substring in S. You may assume ...

AaronYuan 2019-08-14 15:15 評論0 收藏0
[Leetcode]Longest Palindrome

摘要：解題思路我們發現結果其實就是字符的偶數個數是否有單一的字符，如果有就加把單一字符放在回文中間，如果沒有就加字母區分大小寫，代碼 Longest PalindromeGiven a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that...

beita 2019-08-16 10:27 評論0 收藏0
leetcode409.Longest Palindrome

摘要：題目要求輸入一個字符串，計算用這個字符串中的值構成一個最長回數的長度是多少。直觀來看，我們立刻就能想到統計字符串中每個字符出現的次數，如果該字符出現次數為偶數，則字符一定存在于回數中。這個細節需要注意。題目要求 Given a string which consists of lowercase or uppercase letters, find the length of the...

linkin 2019-08-16 15:12 評論0 收藏0
[LeetCode/LintCode] Largest Palindrome Product

Problem Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest palindrome mod 1337. Example Input: 2Output: 987Ex...

Barry_Ng 2019-08-15 18:16 評論0 收藏0
[LeetCode/LintCode] Valid Palindrome

Valid Palindrome Problem Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Example A man, a plan, a canal: Panama is a palindrome. race a ca...

Ververica 2019-08-14 15:16 評論0 收藏0