Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.TreeSet;
- class MnozicaZnakov extends TreeSet<Character> {
- @Override
- public boolean add(Character c) {
- if(c.charValue() >= '0' && c.charValue() <= '9') {
- return super.add(c);
- }
- return false;
- }
- }
- public class Naloga12 {
- static char[][] mat = new char[9][9];
- static char checkRow(char[][] mat, int i) {
- MnozicaZnakov mz = new MnozicaZnakov();
- for(int j = 0; j < mat.length; j++) {
- if(mat[i][j] != '0' && mz.add(mat[i][j]) == false) {
- return mat[i][j];
- }
- }
- return '0';
- }
- static char checkColumn(char[][] mat, int j) {
- MnozicaZnakov mz = new MnozicaZnakov();
- for(int i = 0; i < mat.length; i++) {
- if(mat[i][j] != '0' && mz.add(mat[i][j]) == false) {
- return mat[i][j];
- }
- }
- return '0';
- }
- static char checkSquare(char[][] mat, int i, int j) {
- MnozicaZnakov mz = new MnozicaZnakov();
- for(int a = 0; a < 3; a++) {
- for(int b = 0; b < 3; b++) {
- if(mat[i * 3 + a][j * 3 + b] != '0' && !mz.add(mat[i + 3 + a ][j * 3 + b])) {
- return mat[i * 3 + a][j * 3 + b];
- }
- }
- }
- return '0';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement