FilesExpand file tree

 master

/

ValidAnagram.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

53 lines (49 loc) · 1.28 KB

 master

/

ValidAnagram.java

Copy path

Top

File metadata and controls

• Code
• Blame

53 lines (49 loc) · 1.28 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

// Source : https://leetcode.com/problems/valid-anagram/description/

// Author : Tianming Cao

// Date : 2018-02-11

/**********************************************************************************

*

* 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?

*

**********************************************************************************/

package validAnagram;

public class ValidAnagram {

/**

* Like counting-sort

*/

public boolean isAnagram(String s, String t) {

if (s == null && t == null) {

return true;

}

if (s.length() != t.length()) {

return false;

}

final int mapLen = 26;

int[] map1 = new int[mapLen];

int[] map2 = new int[mapLen];

int len = s.length();

for (int i = 0; i < len; i++) {

char c1 = s.charAt(i);

map1[c1 - 'a']++;

// ASCII of letter a is 97

int c2 = t.charAt(i);

map2[c2 - 97]++;

}

for (int i = 0; i < mapLen; i++) {

if (map1[i] != map2[i]) {

return false;

}

}

return true;

}

}