problem 409. Longest Palindrome solution1: class Solution { public: int longestPalindrome(string s) { map<char, int> temp; for(auto it:s) temp[it]++; , odd = , mid=false; for(auto it=temp.begin(); it!=temp.end(); ++it) { ==) even+=it->second; els…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 方法一:字典统计次数 方法二:HashSet 方法三:次数除以2再乘以2 日期 [LeetCode] 题目地址:https://leetcode.com/problems/longest-palindrome/ Difficulty: Easy 题目描述 Given a string which consists of lowercase or up…

[LeetCode]522. Longest Uncommon Subsequence II 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/longest-uncommon-subsequence-ii/description/ 题目描述: Given a list of strings, you…

题目等级:Easy 题目描述: Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Input: 121 Output: true Example 2: Input: -121 Output: false Explanation: From left to right, it reads -12…

Difficulty: Hard  More:[目录]LeetCode Java实现 Description Given a string S, find the length of the longest substring T that contains at most two distinct characters.For example,Given S = “eceba”,T is "ece" which its length is 3. Intuition 方法一:假设有一个…

Difficulty:easy  More:[目录]LeetCode Java实现 Description https://leetcode.com/problems/valid-palindrome-ii/ Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome. Example 1: Input: "aba" Output…

#-*- coding: UTF-8 -*- from collections import Counterclass Solution(object):    def longestPalindrome(self, s):        """        :type s: str        :rtype: int        """        lopa=0        lopa1=0        slist=list(s)  …

题目如下: Return the largest possible k such that there exists a_1, a_2, ..., a_k such that: Each a_i is a non-empty string; Their concatenation a_1 + a_2 + ... + a_kis equal to text; For all 1 <= i <= k,  a_i = a_{k+1 - i}. Example 1: Input: text = &qu…

Given an unsorted array of integers, find the length of longest increasing subsequence. For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that there may be more than…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 前缀是否回文 判断前缀 相似题目 参考资料 日期 题目地址:https://leetcode.com/problems/shortest-palindrome/description/ 题目描述 Given a string s, you are allowed to convert it to a palindrome by adding char…