-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram6.java
More file actions
77 lines (48 loc) · 1.6 KB
/
program6.java
File metadata and controls
77 lines (48 loc) · 1.6 KB
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
/*
290. Word Pattern
Easy
6.2K
737
Companies
Given a pattern and a string s, find if s follows the same pattern.
Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.
Example 1:
Input: pattern = "abba", s = "dog cat cat dog"
Output: true
Example 2:
Input: pattern = "abba", s = "dog cat cat fish"
Output: false
Example 3:
Input: pattern = "aaaa", s = "dog cat cat dog"
Output: false
*/
package LeetCode_String;
import java.util.HashMap;
import java.util.Map;
import javax.print.FlavorException;
public class program6 {
static boolean wordPattern(String pattern, String s) {
String str[] = s.split(" ");
if(pattern.length()!=str.length){
return false;
}
Map<Character, String> hm
= new HashMap<Character,String>();
for(int i=0;i<pattern.length();i++){
hm.putIfAbsent(pattern.charAt(i),str[i]);
}
System.out.println(hm);
for(int i=0;i<pattern.length();i++){
if(hm.containsKey(pattern.charAt(i))!=hm.containsValue(str[i])){
return false;
}
}
// System.out.println(hm);
return true;
}
public static void main(String[] args) {
String pattern = "aaaa";
String s = "dog dog dog dog";
System.out.println(wordPattern(pattern, s));
}
}