add 820

fishercoder1534 · fishercoder1534 · commit c8058263f422 · 2021-03-06T15:48:41.000-08:00
diff --git a/README.md b/README.md
@@ -421,7 +421,8 @@ _If you like this project, please leave me a star._ &#9733;
 |832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) |  |Easy|
 |830|[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) |  |Easy|
 |824|[Goat Latin](https://leetcode.com/problems/goat-latin/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_824.java) |  |Easy| 
-|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| 
+|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
 |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
diff --git a/src/main/java/com/fishercoder/solutions/_820.java b/src/main/java/com/fishercoder/solutions/_820.java
@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _820 {
+    public static class Solution1 {
+        public int minimumLengthEncoding(String[] words) {
+            Arrays.sort(words, (a, b) -> a.length() - b.length());
+            boolean[] removed = new boolean[words.length];
+            for (int j = words.length - 2; j >= 0; j--) {
+                for (int i = j + 1; i < words.length; i++) {
+                    if (!removed[i]) {
+                        if (words[i].substring(words[i].length() - words[j].length()).equals(words[j])) {
+                            removed[j] = true;
+                            break;
+                        }
+                    }
+                }
+            }
+            int len = 0;
+            for (int i = 0; i < words.length; i++) {
+                if (!removed[i]) {
+                    len += words[i].length();
+                    len++;
+                }
+            }
+            return len;
+        }
+    }
+}
