Created
December 19, 2015 20:01
-
-
Save miaodonghan/6dcf28cd711715ea3b42 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class Solution { | |
public void solveSudoku(char[][] board) { | |
int rLength = board.length; | |
int cLength = board[0].length; | |
List<Character> candidate = new Arraylist<Character>(); | |
for(int i =1; i < rLength+1, i++){ | |
candidate.add((char)i); | |
} | |
for(int i = 0; i < rLength; i++){ | |
for(int j = 0; j < cLength; j++ ){ | |
if(board[i][j] != '.'){ | |
board[i][j].get() | |
} | |
board[i][j].get() | |
} | |
} | |
} | |
public boolean CheckValidNumber(char[][] board, int i, int j){ | |
int rLength = board.length; | |
int cLength = board[0].length; | |
//candidate list | |
List<Character> candidate = new Arraylist<Character>(); | |
candidate = getCandidate(i, j); | |
for(){ | |
} | |
if(i == 8 && j == 8 && candidate.size() == 1){ | |
return true; | |
}else{ | |
return false; | |
} | |
} | |
public Arraylist<Character> getCandidate(char[][] board, int i, int j){ | |
//candidate list | |
List<Character> candidate = new Arraylist<Character>(); | |
Set<Character> s = HashSet<Character>(); | |
//getValidCadidate,Test method | |
//check | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment