zoukankan      html  css  js  c++  java
  • 242. 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.

    Node
    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?


    给定字符串st所有的字符都是小写,判断字符串是否为相同字母异序词

    public boolean isAnagram(String s, String t) {
            int M = s.length();
            int N = t.length();
            if(M != N) 
                return false;
            int sArray[] = new int[128];
            int tArray[] = new int[128];
            for(int i = 0; i < M; i++)
            {
                sArray[s.charAt(i) - 'a']++;
                tArray[t.charAt(i) - 'a']++;
            }
            for(int i = 0; i < sArray.length; i++)
            {
                if(sArray[i] != tArray[i])
                    return false;
            }
            return true;
            
        }
    
  • 相关阅读:
    接口性能测试方案
    如何选择自动化测试框架
    一维和二维前缀和
    高精度 加减乘除
    归并排序 快速排序
    链表
    二分查找
    表达式求值
    c++ const问题小记
    虚继承总结
  • 原文地址:https://www.cnblogs.com/wxshi/p/7694663.html
Copyright © 2011-2022 走看看