Professional Documents
Culture Documents
return primes;
}
int counter = 0;
for(int i = 0;i<str1.length();i++) {
for(int j = 0 ;j<str2.length();j++) {
if(str1.charAt(i)==str2.charAt(j)) {
counter++;
}
if(counter>1)
return false;
}
}
if(counter==1)
return true; // IS "GREAT"
return false;
}
for(int i = 0;i<arr.length-1;i++) {
if(!isDiverseStr(arr[i], arr[i+1])) {
return false;
}
}
return true;
}
}
public static void main(String[] args) {
int [][]arr = {
{1,9,2},
{2,8,6},
{6,9,3}
};
System.out.println(largerValInRow(arr, 3));
System.out.println(vertArr(arr));
}
int maxInRow = 0;
row = row - 1;
for(int i = 0;i<arr[row].length;i++) {
if(arr[row][i]>maxInRow)
maxInRow = arr[row][i];
}
return maxInRow;
}
public static boolean vertArr(int[][] arr) {
int maxColumnIndex = 0;
return true;
}
}
4 שאלה
int maxVal = 0;
int num = 0; // (the index is the number)
for (int i = 0; i < countArr.length; i++) {
if (countArr[i] > maxVal) {
maxVal = countArr[i];
num = i;
}
}
System.err.println(num);
}
}
5 שאלה
}
public static int mixingString(String [] arr) {
String substringFromStr =
chosenStr.substring(startIndex, endIndex + 1);
System.out.println(substringFromStr); // just to check
int count = 0;
for(int i = 0;i<arr.length;i++) {
if(arr[i].contains(substringFromStr))
count++;
}