首页 > 代码库 > leetcode 242. Valid Anagram
leetcode 242. Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.
For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.
Note:
You may assume the string contains only lowercase alphabets.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
判断t是不是s的排列之一
class Solution {public: bool isAnagram(string s, string t) { vector<int>cnt(26); for (int i = 0; i < s.size(); ++i) { int x = s[i] - ‘a‘; cnt[x]++; } for (int i = 0; i < t.size(); ++i) { int x = t[i] - ‘a‘; cnt[x]--; } for (int i = 0; i < 26; ++i) { if (cnt[i] != 0) return false; } return true; }};
leetcode 242. Valid Anagram
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。