LeetCode242 Valid Anagram

最新推荐文章于 2022-12-25 22:26:02 发布

zhangjun62

最新推荐文章于 2022-12-25 22:26:02 发布

阅读量280

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/zhangjun62/article/details/95533035

版权

LeetCode 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

题目：

Given two strings s and t , write a function to determine if t is an anagram of s.

Example 1:

Input: s = "anagram", t = "nagaram"

Output: true

Example 2:

Input: s = "rat", t = "car"

Output: 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?

public class ValidAnagram {
    public static boolean isAnagram(String s, String t) {
        if (s == null || t == null )
            return false;
        if (t.length() < s.length() || t.length() >  s.length())
            return false;
        HashMap<Character, Integer> map = new HashMap<>();
        for (Character c : t.toCharArray()) {
            if ((c >= 'a' && c <= 'z') && map.get(c) ==null)
                map.put(c, 1);
            else if ((c >= 'a' && c <= 'z') && map.get(c) > 0)
                map.put(c, map.get(c) + 1);
        }

        for (Character c : s.toCharArray()) {
            if (map.containsKey(c)) {
                if (map.get(c) > 0)
                    map.put(c, map.get(c) - 1);
            }
            if (map.containsKey(c) && map.get(c) <= 0)
                map.remove(c);
        }
        if (map.size() > 0)
            return false;
        else
            return true;
    }

    public static void main(String[] args) {
//        String s = "anagram";
//        String t = "nagaram";
        String s = "ab";
        String t = "a";
        System.out.println(isAnagram(s, t));
    }
}

LeetCode上字节用数组来构建字母出现频次表，耗时短只有1ms

public class ValidAnagram {
    public static boolean isAnagram(String s, String t) {
        if (s == null || t == null )
            return false;
        if (t.length() < s.length() || t.length() >  s.length())
            return false;

        int[] arr = new int[256];

        for(char c : s.toCharArray()) {
            arr[c]++;
        }

        for(char c : t.toCharArray()) {
            arr[c]--;
        }
        for(int i : arr) {
            if(i != 0) {
                return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
//        String s = "anagram";
//        String t = "nagaram";
        String s = "ab";
        String t = "a";
        System.out.println(isAnagram(s, t));
    }
}