add 1160

Author: fishercoder1534

README.md

@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | O(n) | O(m) | |Easy||
 |5087|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5087.java) | O(1) | O(1) | |Medium||
 |5083|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5083.java) | O(n) | O(1) | |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||

src/main/java/com/fishercoder/solutions/_1160.java

@@ -0,0 +1,65 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * 1160. Find Words That Can Be Formed by Characters
+ *
+ * You are given an array of strings words and a string chars.
+ * A string is good if it can be formed by characters from chars (each character can only be used once).
+ * Return the sum of lengths of all good strings in words.
+ *
+ * Example 1:
+ *
+ * Input: words = ["cat","bt","hat","tree"], chars = "atach"
+ * Output: 6
+ * Explanation:
+ * The strings that can be formed are "cat" and "hat" so the answer is 3 + 3 = 6.
+ *
+ * Example 2:
+ *
+ * Input: words = ["hello","world","leetcode"], chars = "welldonehoneyr"
+ * Output: 10
+ * Explanation:
+ * The strings that can be formed are "hello" and "world" so the answer is 5 + 5 = 10.
+ *
+ * Note:
+ *
+ * 1 <= words.length <= 1000
+ * 1 <= words[i].length, chars.length <= 100
+ * All strings contain lowercase English letters only.
+ * */
+public class _1160 {
+    public static class Solution1 {
+        public int countCharacters(String[] words, String chars) {
+            int length = 0;
+            Map<Character, Integer> map = new HashMap<>();
+            for (char c : chars.toCharArray()) {
+                int count = map.getOrDefault(c, 0);
+                map.put(c, count + 1);
+
+            }
+            for (String word : words) {
+                if (canForm(word, map)) {
+                    length += word.length();
+                }
+            }
+            return length;
+        }
+
+        private boolean canForm(String word, final Map<Character, Integer> map) {
+            Map<Character, Integer> tmp = new HashMap<>(map);
+            for (Character c : word.toCharArray()) {
+                if (tmp.containsKey(c) && tmp.get(c) > 0) {
+                    int count = tmp.get(c);
+                    tmp.put(c, count - 1);
+                } else {
+                    return false;
+                }
+            }
+            return true;
+        }
+
+    }
+}

src/test/java/com/fishercoder/_1160Test.java

@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1160;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1160Test {
+    private static _1160.Solution1 solution1;
+    private static String[] words;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1160.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        words = new String[]{"cat", "bt", "hat", "tree"};
+        assertEquals(6, solution1.countCharacters(words, "atach"));
+    }
+
+    @Test
+    public void test2() {
+        words = new String[]{"hello", "world", "leetcode"};
+        assertEquals(10, solution1.countCharacters(words, "welldonehoneyr"));
+    }
+}