add 816

fishercoder1534 · fishercoder1534 · commit cf709d93d1c9 · 2021-05-15T12:14:56.000-07:00
diff --git a/README.md b/README.md
@@ -468,6 +468,7 @@ _If you like this project, please leave me a star._ &#9733;
 |821|[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_821.java) |  |Easy|
 |820|[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_820.java) |  |Medium|
 |819|[Most Common Word](https://leetcode.com/problems/most-common-word/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_819.java) |  |Easy| HashMap
+|816|[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_816.java) |  |Medium| String
 |814|[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_814.java) |  |Medium| recursion, DFS 
 |811|[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_811.java) | |Easy| HashMap
 |809|[Expressive Words](https://leetcode.com/problems/expressive-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_809.java) | |Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_816.java b/src/main/java/com/fishercoder/solutions/_816.java
@@ -0,0 +1,47 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _816 {
+    public static class Solution1 {
+        public List<String> ambiguousCoordinates(String s) {
+            s = s.substring(1, s.length() - 1);
+            List<String> list = new ArrayList<>();
+            for (int i = 1; i < s.length(); i++) {
+                String x = s.substring(0, i);
+                List<String> xs = findAllPossibilities(x);
+                String y = s.substring(i);
+                List<String> ys = findAllPossibilities(y);
+                for (String j : xs) {
+                    for (String k : ys) {
+                        list.add("(" + j + ", " + k + ")");
+                    }
+                }
+            }
+            return list;
+        }
+
+        private List<String> findAllPossibilities(String str) {
+            List<String> result = new ArrayList<>();
+            if (str.length() == 1) {
+                result.add(str);
+                return result;
+            } else {
+                for (int i = 1; i < str.length(); i++) {
+                    String integerPart = str.substring(0, i);
+                    String floatPart = str.substring(i);
+                    if (integerPart.length() > 1 && integerPart.charAt(0) != '0' && floatPart.charAt(floatPart.length() - 1) != '0') {
+                        result.add(integerPart + "." + floatPart);
+                    } else if (integerPart.length() == 1 && floatPart.charAt(floatPart.length() - 1) != '0') {
+                        result.add(integerPart + "." + floatPart);
+                    }
+                }
+                if (str.charAt(0) != '0') {
+                    result.add(str);
+                }
+            }
+            return result;
+        }
+    }
+}
