[leetcode] 266. Palindrome Permutation 解题报告
来源:互联网 发布:linux下安装bugzilla 编辑:程序博客网 时间:2024/04/28 20:43
题目链接:https://leetcode.com/problems/palindrome-permutation/
Given a string, determine if a permutation of the string could form a palindrome.
For example,"code"
-> False, "aab"
-> True, "carerac"
-> True.
Hint:
- Consider the palindromes of odd vs even length. What difference do you notice?
- Count the frequency of each character.
- If each character occurs even number of times, then it must be a palindrome. How about character which occurs odd number of times?
思路:提示给了很明显的答案,如果所有的字符都出现偶数次,那么肯定可以回文.如果只有一个字符出现奇数次,肯定也可以回文.因此我们只要用一个hash表来记录每个字符的个数,最后再统计一下奇数字符的数目即可.
代码如下:
class Solution {public: bool canPermutePalindrome(string s) { unordered_map<char, int> hash; for(auto ch: s) hash[ch]++; int num = 0; for(auto val: hash) if(val.second % 2) num++; return num <= 1; }};
0 0
- [leetcode] 266. Palindrome Permutation 解题报告
- [Leetcode] 266. Palindrome Permutation 解题报告
- [leetcode] 267. Palindrome Permutation II 解题报告
- [Leetcode] 267. Palindrome Permutation II 解题报告
- 【LeetCode】Next Permutation 解题报告
- LeetCode解题报告--Next Permutation
- [LeetCode] Next Permutation 解题报告
- Leetcode - 266. Palindrome Permutation
- LeetCode 266. Palindrome Permutation
- [LeetCode]Palindrome Number,解题报告
- [LeetCode]Palindrome Partitioning,解题报告
- 【LeetCode】Palindrome Partitioning 解题报告
- LeetCode-Shortest Palindrome-解题报告
- LeetCode解题报告--Palindrome Number
- [LeetCode] Palindrome Number 解题报告
- 【LeetCode】Longest Palindrome 解题报告
- [LeetCode] Palindrome Number 解题报告
- 【LeetCode】Palindrome Number 解题报告
- android:clipChildren属性
- 曾经的你,谢谢。
- 动画
- 268. Missing Number
- Unexpected token u
- [leetcode] 266. Palindrome Permutation 解题报告
- ZOJ 3870
- 如何使用intelij IDEA 显示一个类的所有方法?与eclipse的outline视图类似
- iOS UIScrollView无法滑动/偏移的解决方法
- prestodb安装配置 —参考prestodb官方文档配置
- 著名的C++三大库boost、loki、stlport,及其他c++库应用简述
- iptables指令详解
- Android Design Support Library之TabLayout
- Java中的Timer源码分析及缺陷