forked from prateekshyap/DSA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
MatchSubstringAfterReplacement.java
64 lines (62 loc) · 2.17 KB
/
MatchSubstringAfterReplacement.java
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
/*https://leetcode.com/problems/match-substring-after-replacement/*/
class Solution {
public boolean matchReplacement(String str, String subStr, char[][] mappings) {
HashMap<Character,Set<Character>> map = new HashMap<Character,Set<Character>>();
int i, j, k, sLen = str.length(), subLen = subStr.length();
char startSub = '\0';
boolean result;
char[] s = str.toCharArray();
char[] sub = subStr.toCharArray();
for (char[] mapping : mappings)
{
if (!map.containsKey(mapping[0]))
map.put(mapping[0],new HashSet<Character>());
map.get(mapping[0]).add(mapping[1]);
}
for (i = 0; i <= sLen-subLen; ++i)
{
if (s[i] == sub[0] || (map.containsKey(sub[0]) && map.get(sub[0]).contains(s[i])))
{
result = true;
for (j = i, k = 0; k < subLen; ++j, ++k)
{
if (s[j] != sub[k] && (!map.containsKey(sub[k]) || !map.get(sub[k]).contains(s[j])))
{
result = false;
break;
}
}
if (result) return result;
}
}
return false;
}
}
class Solution {
public boolean matchReplacement(String str, String subStr, char[][] mappings) {
int i, j, k, sLen = str.length(), subLen = subStr.length();
boolean result;
char[] s = str.toCharArray();
char[] sub = subStr.toCharArray();
boolean[][] map = new boolean[128][128];
for (char[] mapping : mappings)
map[(int)mapping[0]][(int)mapping[1]] = true;
for (i = 0; i <= sLen-subLen; ++i)
{
if (s[i] == sub[0] || map[sub[0]][s[i]])
{
result = true;
for (j = i, k = 0; k < subLen; ++j, ++k)
{
if (s[j] != sub[k] && !map[sub[k]][s[j]])
{
result = false;
break;
}
}
if (result) return result;
}
}
return false;
}
}