JAVA_Word Pattern_LeetCode 290 풀이 class Solution { public boolean wordPattern(String pattern, String s) { if(pattern.length() != s.split(" ").length) return false; for(int i=0; i<pattern.length(); i++){ for(int j=i+1; j<pattern.length(); j++){ if(pattern.charAt(j)==pattern.charAt(i)){ if(!s.split(" ")[j].equals(s.split(" ")[i])) return false; }else if(s.split(" ")[j].equals(s.split(" ")[i])) return false; } } return true; } } * 출처 Level up your coding skills and quickly land a job. This is the b...
#JAVA
#JAVA_LeetCode290
#JAVA_WordPattern
#JAVA_WordPattern_LeetCode290
#WordPattern_LeetCode290
원문링크 : JAVA_Word Pattern_LeetCode 290