[LeetCode] Valid Anagram 题解

前言

题目

https://leetcode.com/problems/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?

还是很简单的一道题目，给出两个字符串s和t，判断t是否为s的“anagram”。保证s,t内只有小写字母。

分析

首先要明白Anagram是什么，其实就是“异位构词”，将组成一个词的字母重新排列顺序，出现的字母和每个字母出现的次数都不变，但是出现的位置会变。
明白了这点，我们就能想到最朴素的做法——用一个数组统计每个字母出现的次数，对s,t分别统计，最后作对比。
但其实还有更为简洁的代码写法——由于s,t都是string类，可以sort一下，如果他们是anagrams的话，sort之后两个字符串应该就是完全一样的了。

代码

Solution 1 开数组统计字母出现

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.length() != t.length()) 
            return false;

        int n = s.length();
        int counts1[26] = {0};//store counts for every letter
        int counts2[26] = {0};
        for (int i = 0; i < n; i++) { 
            counts1[s[i] - 'a']++;
        }
        for (int i = 0; i < n; i++) {
            counts2[t[i] - 'a']++;
        }

        for (int i = 0; i < 26; i++)
            if (counts1[i] != counts2[i]) 
                return false;

        return true;
    }
};

Solution 1.1 改良上述代码，节省空间

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.length() != t.length()) return false;
        int n = s.length();
        int counts[26] = {0};//store counts for every letter
        for (int i = 0; i < n; i++) { 
            counts[s[i] - 'a']++;
            counts[t[i] - 'a']--;
        }

        for (int i = 0; i < 26; i++)
            if (counts[i] != 0) return false;

        return true;
    }
};

Solution 2 sort即可

class Solution {
public:
    bool isAnagram(string s, string t) {
      sort(s.begin(), s.end());
      sort(t.begin(), t.end());
      return s == t;
    }
};