直接判断!!!!
public static boolean brotherWord(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
int[] list1 = new int[len1];
int[] list2 = new int[len2];
for (int i = 0; i < len1; i++) {
list1[i] = word1.charAt(i);
}
for (int i = 0; i < len2; i++) {
list2[i] = word2.charAt(i);
}
int num1 = Arrays.stream(list1).reduce(1, (int x, int y) -> x * y);
int num2 = Arrays.stream(list2).reduce(1, (int x, int y) -> x * y);
if (len1 != len2 || word1.equals(word2)) {
return false;
}
return num1 == num2;
}
public static boolean brotherWord(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
int[] list1 = new int[len1];
int[] list2 = new int[len2];
for (int i = 0; i < len1; i++) {
list1[i] = word1.charAt(i);
}
for (int i = 0; i < len2; i++) {
list2[i] = word2.charAt(i);
}
int num1 = Arrays.stream(list1).reduce(1, (int x, int y) -> x * y);
int num2 = Arrays.stream(list2).reduce(1, (int x, int y) -> x * y);
if (len1 != len2 || word1.equals(word2)) {
return false;
}
return num1 == num2;
}
我已经通过这道题!
https://gw-c.nowcoder.com/api/sparta/jump/link?link=https%3A%2F%2Fwww.nowcoder.com%2FquestionTerminal%2F03ba8aeeef73400ca7a37a5f3370fe68
全部评论
相关推荐
03-26 09:42
已编辑
点赞 评论 收藏
转发