首页 > 其他 > 详细

LeetCode:Valid Anagram

时间:2015-08-04 13:04:42      阅读:277      评论:0      收藏:0      [点我收藏+]

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.

 

1 class Solution {
2 public:
3     bool isAnagram(string s, string t) {
4         sort(s.begin(),s.end());
5         sort(t.begin(),t.end());
6         return s==t;
7         
8     }
9 };

 

LeetCode:Valid Anagram

原文:http://www.cnblogs.com/xiaoying1245970347/p/4701313.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!