zoukankan      html  css  js  c++  java
  • [LC] 242. Valid Anagram

    Given two strings s and , 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?

    class Solution {
        public boolean isAnagram(String s, String t) {
            if (s.length() != t.length()) {
                return false;
            }
            char[] charArr = new char[26];
            for (int i = 0; i < s.length(); i++) {
                charArr[s.charAt(i) - 'a'] += 1;
                charArr[t.charAt(i) - 'a'] -= 1;
            }
            for (char ch : charArr) {
                if (ch != 0) {
                    return false;
                }
            }
            return true;
        }
    }
     
  • 相关阅读:
    开发进度二
    开发进度一
    大道至简阅读笔记01
    用户模板和用户评价
    第九周总结
    第八周总结
    NABCD项目分析
    第七周总结
    第六周总结
    构建之法阅读笔记03
  • 原文地址:https://www.cnblogs.com/xuanlu/p/11839618.html
Copyright © 2011-2022 走看看