面试150-43(Leetcode242有效的字母异位词)

代码:

class Solution {
    public boolean isAnagram(String s, String t) {
        int m = s.length();
        int n = t.length();
        Map map1 = new HashMap<>();
        Map map2 = new HashMap<>();
        if(m!=n) return false;
        for(int i=0;i

你可能感兴趣的:(面试,算法,leetcode)