Given a pattern and a string str, find if str 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 str.
Examples:
pattern = "abba", str = "dog cat cat dog" should return true.
pattern = "abba", str = "dog cat cat fish" should return false.
pattern = "aaaa", str = "dog cat cat dog" should return false.
pattern = "abba", str = "dog dog dog dog" should return false.Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.
解析:提供两种方法,第一种方法比较复杂,但是时间复杂度却优于第二种方法。第二种方法利用了Map和set的区别。供大家参考,希望可以和大家交流更好的方法。
import java.util.Scanner;
import javax.swing.text.StyledEditorKit.BoldAction;
public class Solution {
<span style="white-space:pre"> </span>/**
<span style="white-space:pre"> </span> * @param args
<span style="white-space:pre"> </span> */
<span style="white-space:pre"> </span>public static void main(String[] args) {
<span style="white-space:pre"> </span>// TODO Auto-generated method stub
String pattern,str;
Scanner in=new Scanner(System.in);
pattern=in.nextLine();
str=in.nextLine();
Solution wordPattern=new Solution();
boolean b=wordPattern.wordPattern(pattern, str);
if(b)
{
<span style="white-space:pre"> </span> System.out.println(b);
}
else
{System.out.println(b);
<span style="white-space:pre"> </span>
}
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span> public boolean wordPattern(String pattern, String str) {
<span style="white-space:pre"> </span> boolean b=true;
<span style="white-space:pre"> </span> char []charPattern=pattern.toCharArray();
<span style="white-space:pre"> </span> String []strs=str.split(" ");
<span style="white-space:pre"> </span> String []strsPattern=new String[26];
<span style="white-space:pre"> </span> int i=0,j=strs.length-1;
<span style="white-space:pre"> </span> if(charPattern.length!=strs.length)
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> return b;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> while(i<=j)
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> if(charPattern[i]==charPattern[j])
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> if(strs[i].equals(strs[j]))
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> if(strsPattern[charPattern[i]-97]==null)
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> strsPattern[charPattern[i]-97]=strs[i];
<span style="white-space:pre"> </span> }else if(!strsPattern[charPattern[i]-97].equals(strs[i])){
<span style="white-space:pre"> </span>
<span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> break;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> }else
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> break;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> else{
<span style="white-space:pre"> </span> if(!strs[i].equals(strs[j]))
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> if(strsPattern[charPattern[i]-97]==null)
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> strsPattern[charPattern[i]-97]=strs[i];
<span style="white-space:pre"> </span> }else if(!strsPattern[charPattern[i]-97].equals(strs[i])){
<span style="white-space:pre"> </span>
<span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> break;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> if(strsPattern[charPattern[j]-97]==null)
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> strsPattern[charPattern[j]-97]=strs[j];
<span style="white-space:pre"> </span> }else if(!strsPattern[charPattern[j]-97].equals(strs[j])){
<span style="white-space:pre"> </span>
<span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> break;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> }else
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> break;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span>
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> i++;
<span style="white-space:pre"> </span> j--;
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> for(int k1=0;k1<strsPattern.length;k1++)
<span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> for(int k2=k1+1;k2<strsPattern.length;k2++)
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> if(strsPattern[k1]!=null&&strsPattern[k2]!=null)
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> if(strsPattern[k1].equals(strsPattern[k2]))
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> {
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> b=false;
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> break;
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> <span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> }
<span style="white-space:pre"> </span> return b;
<span style="white-space:pre"> </span> }
}
第二种方法
public class Solution {
public boolean wordPattern(String pattern, String str) {
//input check
String[] strs = str.split(" ");
if(pattern.length() != strs.length ) return false;
Map<Character, String> map = new HashMap<>();
Set<String> unique = new HashSet<>();
for(int i=0; i<pattern.length(); i++) {
char c = pattern.charAt(i);
if(map.containsKey(c) ) {
if(!map.get(c).equals(strs[i])) return false;
} else {
if(unique.contains(strs[i])) return false;
map.put(c, strs[i]);
unique.add(strs[i]);
}
}
return true;
}
}