FilesExpand file tree

 master

/

IsAnagram.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (37 loc) · 990 Bytes

 master

/

IsAnagram.java

Copy path

Top

File metadata and controls

• Code
• Blame

44 lines (37 loc) · 990 Bytes

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

package leetcode.string;

/**

* 有效的字母异位词

* 给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。

*

* 示例 1:

*

* 输入: s = "anagram", t = "nagaram"

* 输出: true

* 示例 2:

*

* 输入: s = "rat", t = "car"

* 输出: false

*/

public class IsAnagram {

public static void main(String[] args) {

String s = "anagram", t = "nagaram";

System.out.println(isAnagram(s, t));

}

public static boolean isAnagram(String s, String t) {

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

return false;

}

// 代表26个字母

int[] srray = new int[26];

int[] trray = new int[26];

for (int i = 0; i < s.length(); i++) {

srray[s.charAt(i)-97]++;

trray[t.charAt(i)-97]++;

}

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

if (srray[i] != trray[i])

return false;

}

return true;

}

}