-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNeighbor.java
More file actions
63 lines (59 loc) · 1.52 KB
/
Copy pathNeighbor.java
File metadata and controls
63 lines (59 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import java.io.*;
import java.util.*;
public class Neighbor{
public static void main(String [] a){
int[][] array = {{3,3,7},
{8,7,6},
{1,5,9},
{5,3,3}
};
printArr(array);
printBiggest(array);
}
public static boolean biggestNeighbor(int[][] array, int i, int j){//finds if given element is biggest in 4 neighborhood
//parameters: int[][] array, int i, int j
int v = array[i][j];
if(i !=(array.length-1) && array[i+1][j]>v){//bottom row case
return false;
}
else if(i != 0 && array[i-1][j]>v){//top row case
return false;
}
else if(j != 0 && array[i][j-1]>v){//left column case
return false;
}
else if(j != array[i].length-1 && array[i][j+1]>v){//right column case
return false;
}
return true; //if none of the four neighbors were bigger, return true
}
public static void printBiggest(int array [][]){//prints biggest neighbors
//parameter: int array [][]
int ind = 0;
int ind2 = 0;
while(ind<array.length){
ind2 = 0;
while(ind2<array[0].length){
if(biggestNeighbor(array, ind, ind2)==true){//if array element is the biggest neighbor
System.out.println("[" + ind + "]" + "[" + ind2 + "]");//print element
}
ind2++;
}
ind++;
}
}
public static void printArr(int [][] array){//prints array
//parameter: int[][] array
int ind = 0;
int ind2 = 0;
while(ind<array.length){
ind2 = 0;
while(ind2<array[ind].length){
System.out.print(array[ind][ind2] + " ");
ind2++;
}
System.out.println("");
ind++;
}
}
}