LeetCode之旅(13)-Valid Anagram
来源:互联网 发布:javascript书籍百度云 编辑:程序博客网 时间:2024/04/29 18:40
题目介绍:
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.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case? ##
思路分析:
题意是判断两个字符串包含的字符是不是相同,这样的问题,可以通过排序来简化 ,这个题目和前面的一个一片博客的题目(判断数组是否包含重复的元素)很相似,可以对照着
leetcode之旅(8)-Contains Duplicate
代码:
public class Solution { public boolean isAnagram(String s, String t) { char[] oneArray = s.toCharArray(); char[] twoArray = t.toCharArray(); Arrays.sort(oneArray); Arrays.sort(twoArray); int oneLength = oneArray.length; int twoLength = twoArray.length; if(oneLength ==twoLength){ for(int i = 0;i < oneLength;i++){ if(oneArray[i] == twoArray[i]){ }else{ return false; } } }else{ return false; } return true; }}
0 0
- LeetCode之旅(13)-Valid Anagram
- LeetCode之Valid Anagram
- leetcode 之valid anagram
- leetcode之valid anagram
- LeetCode OJ 之 Valid Anagram
- leetcode算法之Valid Anagram
- 【LeetCode】马三来刷题之Valid Anagram
- LeetCode(242)Valid Anagram
- leetcode之242. Valid Anagram(C++解法)
- leetcode之242. Valid Anagram(C++解法)
- LeetCode之Valid Anagram (Java+C/C++)
- LeetCode之路:242. Valid Anagram
- <LeetCode><Easy>242Valid Anagram (排序)
- Leetcode:242. Valid Anagram(JAVA)
- LeetCode:有效变形词(Valid Anagram)
- leetcode(5),Valid Anagram(python)
- LeetCode 242. Valid Anagram 题解(C++)
- Leetcode #242 Valid Anagram
- IOS学习之——懒加载代码
- nyoj16矩阵嵌套
- IPC
- 关于大型网站技术演进的思考(二十一)--网站静态化处理—web前端优化—下【终篇】(13)
- appium java环境搭建
- LeetCode之旅(13)-Valid Anagram
- POJ 2773 Happy 2006
- 大数据技术大合集:Hadoop家族、Cloudera系列、spark、storm
- IOS学习之——实现数据源的方法(代码)
- 多线程断点下载
- 前端 简单实现应用商店list
- osgexp安装与使用
- 我们也说说Android.mk(3) - 宏
- 导入文章“Apache Spark学习:将Spark部署到Hadoop 2.2.0上”中给出的 assembly/target/scala-2.9.3/目录下的spark-assembly-0.8.