242.判断一个字符串是否为另一个的乱序 Valid Anagram

错误1

"aa"

"bb"

1. static public bool IsAnagram(string s, string t) {
2. int sLength = s.Length;
3. int tLength = t.Length;
4. if (sLength != tLength) {
5. return false;
6. }
8. char c = ' ';
9. int value = 0;
10. Dictionary<char, int> d = new Dictionary<char, int>();
11. for (int i = 0; i < sLength; i++) {
12. c = s[i];
13. if (d.TryGetValue(c, out value)) {
14. d[c] += 1;
15. } else {
16. d[c] = 1;
17. }
18. c = t[i];
19. if (d.TryGetValue(c, out value)) {
20. d[c] += 1;
21. } else {
22. d[c] = 1;
23. }
24. }
26. foreach(int i in d.Values) {
27. if (i % 2 != 0) {
28. return false;
29. }
30. }
31. return true;
32. }

解法

1. public class Solution {
2. public bool IsAnagram(string s, string t) {
3. int sLength = s.Length;
4. int tLength = t.Length;
5. if (sLength != tLength) {
6. return false;
7. }
9. char[] sChars = s.ToCharArray();
10. char[] tChars = t.ToCharArray();
12. Array.Sort(sChars);
13. Array.Sort(tChars);
15. for (int i = 0; i < sLength; i++) {
16. if (sChars[i] != tChars[i]) {
17. return false;
18. }
19. }
20. return true;
21. }
22. }

来自为知笔记(Wiz)