leetcode算法之Valid Anagram
2015-08-04 16:22
274 查看
原文算法说明如下:
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.
翻译:判断给定的两个字符串是否为打乱了顺序的同一个字符串
我的java实现:
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.
翻译:判断给定的两个字符串是否为打乱了顺序的同一个字符串
我的java实现:
import java.util.HashMap; public class Solution { public boolean isAnagram(String s, String t) { if(s.length() != t.length()){ return false; } char[] c1 = s.toCharArray(); char[] c2 = t.toCharArray(); HashMap<Character,Integer> map1 = new HashMap<Character,Integer>(); HashMap<Character,Integer> map2 = new HashMap<Character,Integer>(); for(int i=0;i < s.length();i++){ if(!map1.containsKey(c1[i])){ map1.put(c1[i], 1); }else{ map1.put(c1[i], map1.get(c1[i])+1); } if(!map2.containsKey(c2[i])){ map2.put(c2[i], 1); }else{ map2.put(c2[i], map2.get(c2[i])+1); } } if(map1.entrySet().containsAll(map2.entrySet()) && map2.entrySet().containsAll(map1.entrySet())){ return true; } return false; } }
相关文章推荐
- 博客搬家。新博客地址 http://fangjian0423.github.io/
- Python3学习(3)-高级篇
- 一致性hash算法 介绍
- centos7.0_redhat7.0安装vncserver和Desktop桌面
- Android 4.4 Fence在SurfaceFlinger中的应用
- DataRow dr = dt.NewRow();
- PyDev+eclipse
- Uva 10601 Cubes 六维背包+burnside引理
- Merge Into 语句代替Insert/Update在Oracle中的应用实战
- arcGIS将多个栅格拼接并输出
- 怎样去掉FireFox的导入向导
- 注解 annotation
- jQuery实现Ajax应用加载(load/getJSON/getScript/get/post/serialize/ajax/ajaxSetup/ajaxStart/ajaxStop)
- 编程规范
- 石油科研与Wiseteam工作站
- java中使用OpenSSL生成的RSA公私钥进行数据加解密
- Leetcode 166 Fraction to Recurring Decimal 分数化小数
- android新组件RecyclerView使用介绍和进阶使用,替用Gallery
- Lucene各种Query
- C 语言中的好基友 数组和指针之二