LeetCode 242. Valid Anagram

最新推荐文章于 2023-06-03 15:41:14 发布

sqyx008

最新推荐文章于 2023-06-03 15:41:14 发布

阅读量153

点赞数

分类专栏： LeetCode 文章标签： leetcode anagram string cpp

本文链接：https://blog.csdn.net/sqyx008/article/details/66967905

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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.

Analysis

let a table count the times every letter appears. Specifically, for string $s$ we increase the numbers while for string $t$ decrease them. If valid, all elements in the table should be 0.

Code

class Solution {
public:
    bool isAnagram(string s, string t) {
        int count[26]={0};
        for (char c : s) count[c-97]++;
        for (char c : t) count[c-97]--;
        for (int i : count)
            if (i != 0) return false;
        return true;
    }
};