-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram3.java
More file actions
56 lines (37 loc) · 1.13 KB
/
program3.java
File metadata and controls
56 lines (37 loc) · 1.13 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
/*
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;
public class program3 {
static boolean wordPattern(String pattern, String s) {
boolean flag = false;
HashMap<char[],String> map = new HashMap<char[],String>();
if(s.length()!=pattern.length()){
return false;
}
else{
}
return flag;
}
public static void main(String[] args) {
String s ="dog cat cat dog";
String pattern = "abba";
System.out.println(wordPattern(pattern,s));
}
}