JAVASCRIPT Leetcode409.Longest Palindrome

最新推荐文章于 2024-09-16 06:54:08 发布

yuki_bird

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量170

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/yuki_bird/article/details/108019782

版权

409.Longest Palindrome

题目：
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.

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.

关键词：回文串，Set，String
思路：

考虑char, freq, 可以用map，也可以用set 抵消法，出现就delete，没出现就add

解答：

var longestPalindrome = function(s) {
    if (!s || s.length == 0) return 0;
    let set = new Set();//for offset
    for (let c of s){
        if (set.has(c)) set.delete(c);
        else set.add(c);
    }
    //special case
    if (set.size == 0) return s.length;
    return s.length - set.size + 1;
};