add 51

fishercoder1534 · fishercoder1534 · commit 04cda9b61049 · 2017-06-17T09:18:27.000-07:00
diff --git a/README.md b/README.md
@@ -472,6 +472,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |55|[Jump Game](https://leetcode.com/problems/jump-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_55.java)|O(n)|O(1)|Medium| Greedy
 |54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_54.java)|O(m*n)|O(m*n)|Medium| Array
 |53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_53.java)|O(n)|O(1)|Easy|
+|51|[N-Queens](https://leetcode.com/problems/n-queens/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_51.java)|O(?)|O(?)|Hard|
 |50|[Pow(x, n)](https://leetcode.com/problems/powx-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_50.java)|O(logn)|O(logn)|Medium|
 |49|[Group Anagrams](https://leetcode.com/problems/anagrams/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_49.java)|O(m*logn)|O(m*n)|Medium| HashMap
 |48|[Rotate Image](https://leetcode.com/problems/rotate-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_48.java)|O(n^2)|O(1)|Medium|Array
diff --git a/src/main/java/com/fishercoder/solutions/_51.java b/src/main/java/com/fishercoder/solutions/_51.java
@@ -27,7 +27,7 @@
  ".Q.."]
  ]
  */
-public class NQueens {
+public class _51 {
 
     public List<List<String>> solveNQueens(int n) {
         List<List<String>> result = new ArrayList<>();
@@ -88,7 +88,7 @@ private ArrayList<String> drawChessBoard(ArrayList<Integer> col) {
     }
 
     public static void main (String...args) {
-        NQueens test = new NQueens();
+        _51 test = new _51();
 
         ArrayList<Integer> col = new ArrayList<>();
         col.add(0);//false, false, true, true,
diff --git a/src/test/java/com/fishercoder/_51Test.java b/src/test/java/com/fishercoder/_51Test.java
@@ -1,6 +1,6 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.NQueens;
+import com.fishercoder.solutions._51;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -11,15 +11,15 @@
 
 import static junit.framework.Assert.assertEquals;
 
-public class NQueensTest {
-    private static NQueens test;
+public class _51Test {
+    private static _51 test;
     private static List<List<String>> expected;
     private static List<List<String>> actual;
     private static int n;
 
     @BeforeClass
     public static void setup(){
-        test = new NQueens();
+        test = new _51();
     }
 
     @Before

Original file line number	Diff line number	Diff line change
`@@ -27,7 +27,7 @@`
`27`	`27`	`".Q.."]`
`28`	`28`	`]`
`29`	`29`	`*/`
`30`		`-public class NQueens {`
	`30`	`+public class _51 {`
`31`	`31`
`32`	`32`	`public List<List<String>> solveNQueens(int n) {`
`33`	`33`	`List<List<String>> result = new ArrayList<>();`
`@@ -88,7 +88,7 @@ private ArrayList<String> drawChessBoard(ArrayList<Integer> col) {`
`88`	`88`	`}`
`89`	`89`
`90`	`90`	`public static void main (String...args) {`
`91`		`- NQueens test = new NQueens();`
	`91`	`+ _51 test = new _51();`
`92`	`92`
`93`	`93`	`ArrayList<Integer> col = new ArrayList<>();`
`94`	`94`	`col.add(0);//false, false, true, true,`