- public static boolean pedineContigue (boolean S[][]) {
- boolean contigue = false;
- for (int i = 0; i< S.length; i++) {
- for (int j = 0; j < S[i].length; j++) {
- do {
- if(S[i][j] == S[i+1][j] || S[i][j] == S[i][j+1])
- contigue = true;
- else
- contigue = false;
- } while(i<(S.length - 1) && j<(S[i].length -1));
- }
- }
- if (contigue == true)
- return true;
- else
- return false;
- }