Leet Code OJ 242. Valid Anagram [Difficulty: Easy]

题目：
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?

分析：
题意是给定2个字符串，判断这2个字符串是否由相同的字符组成，并且对应字符的个数一致。

代码实现（时间复杂度O（n^2））：

public class Solution {public boolean isAnagram(String s, String t) {char[] sarr=s.toCharArray();char[] tarr=t.toCharArray();if(sarr.length!=tarr.length){return false;}for(int i=0;i<sarr.length;i++){boolean found=false;for(int j=i;j<sarr.length;j++){if(sarr[i]==tarr[j]){found=true;if(i!=j){tarr[j]=tarr[i];tarr[i]=sarr[i];}break;}}if(found==false){return false;}}return true;}
}

Leet Code OJ 242. Valid Anagram [Difficulty: Easy]相关推荐

Leet Code OJ 125. Valid Palindrome [Difficulty: Easy]
题目: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ig ...
Leet Code OJ 20. Valid Parentheses [Difficulty: Easy]
题目: Given a string containing just the characters , determine if the input string is valid. The brac ...
Leet Code OJ 112. Path Sum [Difficulty: Easy]
题目: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up ...
Leet Code OJ 344. Reverse String [Difficulty: Easy]
题目: Write a function that takes a string as input and returns the string reversed. Example: Given s ...
Leet Code OJ 28. Implement strStr() [Difficulty: Easy]
题目: Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if ne ...
Leet Code OJ 1. Two Sum [Difficulty: Easy]
题目: Given an array of integers, return indices of the two numbers such that they add up to a specifi ...
Leet Code OJ 223. Rectangle Area [Difficulty: Easy]
题目: Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defin ...
Leet Code OJ 189. Rotate Array [Difficulty: Easy]
题目: Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the ar ...
Leet Code OJ 66. Plus One [Difficulty: Easy]
题目: Given a non-negative number represented as an array of digits, plus one to the number. The digit ...

Leet Code OJ 242. Valid Anagram [Difficulty: Easy]

Leet Code OJ 242. Valid Anagram [Difficulty: Easy]相关推荐

最新文章

热门文章