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;
        }
    }
     
  • 相关阅读:
    Java学习9
    Windows环境下实现WireShark抓取HTTPS
    WireShark新手使用教程
    charles使用教程
    charles
    知道做到
    Appium 自动化测试改造思路
    今日总结
    今日总结
    今日总结
  • 原文地址:https://www.cnblogs.com/xuanlu/p/11839618.html
Copyright © 2011-2022 走看看