FilesExpand file tree

 master

/

IsomophricString.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

94 lines (81 loc) · 2.76 KB

 master

/

IsomophricString.java

Copy path

Top

File metadata and controls

• Code
• Blame

94 lines (81 loc) · 2.76 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

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

/*Given two strings s and t, determine if they are isomorphic.

Two strings are isomorphic if the characters in s can be replaced to get t.

All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.

For example,

Given "egg", "add", return true.

Given "foo", "bar", return false.

Given "paper", "title", return true.*/

public class Solution {

public boolean isIsomorphic(String s, String t) {

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

return false;

}

Map<Character, Character> map = new HashMap<Character, Character>();

Map<Character, Character> map2 = new HashMap<Character, Character>();

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

if (!map.containsKey(s.charAt(i))) {

map.put(s.charAt(i), t.charAt(i));

} else {

if (map.get(s.charAt(i)) != t.charAt(i)) {

return false;

}

}

if (!map2.containsKey(t.charAt(i))) {

map2.put(t.charAt(i), s.charAt(i));

} else {

if (map2.get(t.charAt(i)) != s.charAt(i)) {

return false;

}

}

}

return true;

}

}

// One Map

public class Solution {

public boolean isIsomorphic(String s, String t) {

if(s == null || s.length() <= 1) return true;

HashMap<Character, Character> map = new HashMap<Character, Character>();

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

char a = s.charAt(i);

char b = t.charAt(i);

if(map.containsKey(a)){

if(map.get(a).equals(b))

continue;

else

return false;

}else{

if(!map.containsValue(b))

map.put(a,b);

else return false;

}

}

return true;

}

}

// Two array

public boolean isIsomorphic(String s, String t) {

int[] map = new int[128];

int[] book = new int[128];

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

int cs = (int) s.charAt(i);

int ts = (int) t.charAt(i);

if (map[cs] == 0 && book[ts] == 0) {

map[cs] = ts;

book[ts] = 1;

} else if (map[cs] != ts)

return false;

}

return true;

}

// One array

public class Solution {

public boolean isIsomorphic(String s1, String s2) {

int[] m = new int[512];

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

if (m[s1.charAt(i)] != m[s2.charAt(i)+256]) return false;

m[s1.charAt(i)] = m[s2.charAt(i)+256] = i+1;

}

return true;

}

}