fd

Author: liwentian

README.md

@@ -191,7 +191,8 @@
 |241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/DifferenceWaysToAddParentheses.java)||
 |242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ValidAnagram.java)|100|
 |243|[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/ShortestWordDistance.java)|80|
-|246|[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/StrobogrammaticNumber.java)|70|这是一个系列，多看两遍|
+|246|[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/StrobogrammaticNumber.java)|70|#247一个系列，多看两遍|
+|247|[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/StrobogrammaticNumberII.java)|70|多看两遍|
 |250|[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CountUnivalueSubtrees.java)|70|这题要多做几遍|
 |251|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/Vector2D.java)|100|
 |252|[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MeetingRooms.java)|100|

google/src/main/java/com/leetcode/google/StrobogrammaticNumberII.java

@@ -0,0 +1,38 @@
+package com.leetcode.google;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Created by liwentian on 2017/8/31.
+ */
+
+public class StrobogrammaticNumberII {
+
+
+    public List<String> findStrobogrammatic(int n) {
+        return helper(n, n);
+    }
+
+    private List<String> helper(int k, int n) {
+        if (k == 0) {
+            return Arrays.asList("");
+        } else if (k == 1) {
+            return Arrays.asList("0", "1", "8");
+        }
+        List<String> result = new LinkedList<>();
+        for (String s : helper(k - 2, n)) {
+            if (k != n) {
+                result.add("0" + s + "0");
+            }
+
+            result.add("1" + s + "1");
+            result.add("8" + s + "8");
+            result.add("6" + s + "9");
+            result.add("9" + s + "6");
+        }
+        return result;
+    }
+}

solution/src/main/java/com/inuker/solution/StrobogrammaticNumber.java

@@ -0,0 +1,20 @@
+package com.inuker.solution;
+
+/**
+ * Created by liwentian on 2017/8/31.
+ */
+
+/**
+ * 旋转180度，而不是上下镜像
+ */
+public class StrobogrammaticNumber {
+
+    public boolean isStrobogrammatic(String num) {
+        for (int i = 0, j = num.length() - 1; i <= j; i++, j--) {
+            if (!"11 88 00 696".contains(num.charAt(i) + "" + num.charAt(j))) {
+                return false;
+            }
+        }
+        return true;
+    }
+}

test/src/main/java/com/example/Main.java

@@ -4,6 +4,7 @@
 import com.leetcode.google.MissingRanges;
 import com.leetcode.google.SentenceScreenFitting;
 import com.leetcode.google.ShortestDistanceFromAllBuildings;
+import com.leetcode.google.StrobogrammaticNumberII;
 import com.leetcode.google.UTFValidation;
 import com.leetcode.google.WordSquares;
 import com.leetcode.google.ZigzagIterator;
@@ -15,10 +16,10 @@
 public class Main {
 
     public static void main(String[] args) {
-        boolean n = new UTFValidation().validUtf8(new int[] {
-                197, 130, 1
-        });
-        System.out.println(n);
+        List<String> list = new StrobogrammaticNumberII().findStrobogrammatic(4);
+        for (String s : list) {
+            System.out.print(s + " ");
+        }
     }
 }