/**
Given a sequence of words, check whether it forms a valid word square.
A sequence of words forms a valid word square if the kth row and column read the exact same string, where 0 รข‰¤k < max(numRows, numColumns).
Note:
The number of words given is at least 1 and does not exceed 500.
Word length will be at least 1 and does not exceed 500.
Each word contains only lowercase English alphabet a-z.
Example 1:
Input:
[
"abcd",
"bnrt",
"crmy",
"dtye"
]
Output:
true
Explanation:
The first row and first column both read "abcd".
The second row and second column both read "bnrt".
The third row and third column both read "crmy".
The fourth row and fourth column both read "dtye".
Therefore, it is a valid word square.
Example 2:
Input:
[
"abcd",
"bnrt",
"crm",
"dt"
]
Output:
true
Explanation:
The first row and first column both read "abcd".
The second row and second column both read "bnrt".
The third row and third column both read "crm".
The fourth row and fourth column both read "dt".
Therefore, it is a valid word square.
Example 3:
Input:
[
"ball",
"area",
"read",
"lady"
]
Output:
false
Explanation:
The third row reads "read" while the third column reads "lead".
Therefore, it is NOT a valid word square.
*/
import java.util.*;
class WordSquareValid{
public static boolean isValid(List<String> words){
if(words==null || words.size()<1){
return true;
}
if(words.size()!=words.get(0).length()){
return false;
}
for(int i=0;i<words.size(); i++){
for(int j=0;j<words.get(i).length(); j++){
//if this word is longer than total number of words or total words is greater than length of this word or the chars at the respective positions do not match
//j>=words.size() || i>=words.get(j).length() ||
if(words.get(i).charAt(j)!=words.get(j).charAt(i)){
return false;
}
}
}
return true;
}
public static void main(String args[]){
List<String> words1 = new ArrayList<>();
words1.add("abcd");
words1.add("bnrt");
words1.add("crm");
words1.add("dt");
System.out.println(isValid(words1));
words1 = new ArrayList<>();
words1.add("abcd");
words1.add("bnrt");
words1.add("crmy");
words1.add("dtye");
System.out.println(isValid(words1));
List<String> words2 = new ArrayList<>();
words2.add("ball");
words2.add("area");
words2.add("read");
words2.add("lady");
System.out.println(isValid(words2));
}
}
Given a sequence of words, check whether it forms a valid word square.
A sequence of words forms a valid word square if the kth row and column read the exact same string, where 0 รข‰¤k < max(numRows, numColumns).
Note:
The number of words given is at least 1 and does not exceed 500.
Word length will be at least 1 and does not exceed 500.
Each word contains only lowercase English alphabet a-z.
Example 1:
Input:
[
"abcd",
"bnrt",
"crmy",
"dtye"
]
Output:
true
Explanation:
The first row and first column both read "abcd".
The second row and second column both read "bnrt".
The third row and third column both read "crmy".
The fourth row and fourth column both read "dtye".
Therefore, it is a valid word square.
Example 2:
Input:
[
"abcd",
"bnrt",
"crm",
"dt"
]
Output:
true
Explanation:
The first row and first column both read "abcd".
The second row and second column both read "bnrt".
The third row and third column both read "crm".
The fourth row and fourth column both read "dt".
Therefore, it is a valid word square.
Example 3:
Input:
[
"ball",
"area",
"read",
"lady"
]
Output:
false
Explanation:
The third row reads "read" while the third column reads "lead".
Therefore, it is NOT a valid word square.
*/
import java.util.*;
class WordSquareValid{
public static boolean isValid(List<String> words){
if(words==null || words.size()<1){
return true;
}
if(words.size()!=words.get(0).length()){
return false;
}
for(int i=0;i<words.size(); i++){
for(int j=0;j<words.get(i).length(); j++){
//if this word is longer than total number of words or total words is greater than length of this word or the chars at the respective positions do not match
//j>=words.size() || i>=words.get(j).length() ||
if(words.get(i).charAt(j)!=words.get(j).charAt(i)){
return false;
}
}
}
return true;
}
public static void main(String args[]){
List<String> words1 = new ArrayList<>();
words1.add("abcd");
words1.add("bnrt");
words1.add("crm");
words1.add("dt");
System.out.println(isValid(words1));
words1 = new ArrayList<>();
words1.add("abcd");
words1.add("bnrt");
words1.add("crmy");
words1.add("dtye");
System.out.println(isValid(words1));
List<String> words2 = new ArrayList<>();
words2.add("ball");
words2.add("area");
words2.add("read");
words2.add("lady");
System.out.println(isValid(words2));
}
}
No comments:
Post a Comment