码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode——Valid Anagram

时间:2015-08-04 02:02:27      阅读:119      评论:0      收藏:0      [点我收藏+]

标签:

Description:

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.

Note: You may assume the string contains only lowercase alphabets.

 

public class Solution {
    public static boolean isAnagram(String s, String t) {
        if(s.equals(t)) {
            return true;
        }
        char[] ss = s.toCharArray();
        char[] tt = t.toCharArray();
        Arrays.sort(ss);
        Arrays.sort(tt);
        return (new String(ss)).equals((new String(tt)));
    }
}

 

LeetCode——Valid Anagram

标签:

原文地址:http://www.cnblogs.com/wxisme/p/4700830.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!