[LintCode]Two Strings Are Anagrams(C++|Java|Python)
2017-08-05 15:24
281 查看
C++ Version:
class Solution {
public:
/**
* @param s: The first string
* @param b: The second string
* @return true or false
*/
bool anagram(string s, string t) {
// write your code here
int count[128][2] = {0};
if (s.length() != t.length()) {
return false;
}
for (int i = 0; i < s.length(); i++) {
count[s[i]][0]++;
count[t[i]][1]++;
}
for (int i = 0; i < 128; i++) {
if (count[i][0] != count[i][1]) {
return false;
}
}
return true;
}
};
Java Version:
public class Solution {
/**
* @param s: The first string
* @param b: The second string
* @return true or false
*/
public boolean anagram(String s, String t) {
// write your code here
char[] a = s.toCharArray();
char[] b = t.toCharArray();
int i = 0;
int[][] count = new int[128][2];
if (a.length != b.length){
return false;
}
for (i = 0; i < a.length; i++){
count[Integer.valueOf(a[i])][0]++;
count[Integer.valueOf(b[i])][1]++;
}
for (i = 0; i < 128; i++){
if (count[i][0] != count[i][1]){
return false;
}
}
return true;
}
};
Python Version:
class Solution:
"""
@param s: The first string
@param b: The second string
@return true or false
"""
def anagram(self, s, t):
# write your code here
if len(s) != len(t):
return False
for c in s:
if t.count(c) != s.count(c):
return False
return True
class Solution {
public:
/**
* @param s: The first string
* @param b: The second string
* @return true or false
*/
bool anagram(string s, string t) {
// write your code here
int count[128][2] = {0};
if (s.length() != t.length()) {
return false;
}
for (int i = 0; i < s.length(); i++) {
count[s[i]][0]++;
count[t[i]][1]++;
}
for (int i = 0; i < 128; i++) {
if (count[i][0] != count[i][1]) {
return false;
}
}
return true;
}
};
Java Version:
public class Solution {
/**
* @param s: The first string
* @param b: The second string
* @return true or false
*/
public boolean anagram(String s, String t) {
// write your code here
char[] a = s.toCharArray();
char[] b = t.toCharArray();
int i = 0;
int[][] count = new int[128][2];
if (a.length != b.length){
return false;
}
for (i = 0; i < a.length; i++){
count[Integer.valueOf(a[i])][0]++;
count[Integer.valueOf(b[i])][1]++;
}
for (i = 0; i < 128; i++){
if (count[i][0] != count[i][1]){
return false;
}
}
return true;
}
};
Python Version:
class Solution:
"""
@param s: The first string
@param b: The second string
@return true or false
"""
def anagram(self, s, t):
# write your code here
if len(s) != len(t):
return False
for c in s:
if t.count(c) != s.count(c):
return False
return True
相关文章推荐
- lintcode --- Two Strings Are Anagrams
- Lintcode: Two Strings Are Anagrams
- Two Strings Are Anagrams-LintCode
- lintcode-easy-Two Strings Are Annagrams
- LeetCode 4 — Median of Two Sorted Arrays (C++ Java Python)
- Two Strings Are Anagrams
- #158 Two Strings Are Anagrams
- Two Strings Are Anagrams
- [LeetCode] 004. Median of Two Sorted Arrays (Hard) (C++/Java/Python)
- 【4】Decide if two strings are anagrams or not
- [Amazon] Two Strings Are Anagrams (Compare Strings)
- [CrackCode] 1.4 Write a method to decide if two strings are anagrams or not
- LintCode Two Strings Are Anagrams 两个字符串是变位词
- Lintcode158 Two Strings Are Anagrams solution 题解
- Two Strings Are Anagrams
- LeetCode 21 — Merge Two Sorted Lists(C++ Java Python)
- two-strings-are-anagrams&&compare-strings&&longest-words
- LeetCode 2 — Add Two Numbers(C++ Java Python)
- LeetCode 1 — Two Sum(C++ Java Python)
- Two Strings Are Anagrams