feat: add solutions to lc problem: No.1705

* Add solutions to lc problem: No.1705.Maximum Number of Eaten Apples
* Update python solutions

Author: yanglbme

lcci/01.02.Check Permutation/README.md

@@ -44,7 +44,7 @@ class Solution:
         n1, n2 = len(s1), len(s2)
         if n1 != n2:
             return False
-        counter = collections.Counter()
+        counter = Counter()
         for i in range(n1):
             counter[s1[i]] += 1
             counter[s2[i]] -= 1
@@ -84,16 +84,18 @@ class Solution {
 ### **JavaScript**
 
 ```js
-var CheckPermutation = function(s1, s2) {
-    let n1 = s1.length, n2 = s2.length;
-    if (n1 != n2) return false;
-    let counter = {};
-    for (let i = 0; i < n1; i++) {
-        let cur1 = s1.charAt(i), cur2 = s2.charAt(i);
-        counter[cur1] = (counter[cur1] || 0) + 1;
-        counter[cur2] = (counter[cur2] || 0) - 1;
-    }
-    return Object.values(counter).every(v => v == 0);
+var CheckPermutation = function (s1, s2) {
+  let n1 = s1.length,
+    n2 = s2.length;
+  if (n1 != n2) return false;
+  let counter = {};
+  for (let i = 0; i < n1; i++) {
+    let cur1 = s1.charAt(i),
+      cur2 = s2.charAt(i);
+    counter[cur1] = (counter[cur1] || 0) + 1;
+    counter[cur2] = (counter[cur2] || 0) - 1;
+  }
+  return Object.values(counter).every((v) => v == 0);
 };
 ```
 

lcci/01.02.Check Permutation/README_EN.md

@@ -44,7 +44,7 @@ class Solution:
         n1, n2 = len(s1), len(s2)
         if n1 != n2:
             return False
-        counter = collections.Counter()
+        counter = Counter()
         for i in range(n1):
             counter[s1[i]] += 1
             counter[s2[i]] -= 1
@@ -82,16 +82,18 @@ class Solution {
 ### **JavaScript**
 
 ```js
-var CheckPermutation = function(s1, s2) {
-    let n1 = s1.length, n2 = s2.length;
-    if (n1 != n2) return false;
-    let counter = {};
-    for (let i = 0; i < n1; i++) {
-        let cur1 = s1.charAt(i), cur2 = s2.charAt(i);
-        counter[cur1] = (counter[cur1] || 0) + 1;
-        counter[cur2] = (counter[cur2] || 0) - 1;
-    }
-    return Object.values(counter).every(v => v == 0);
+var CheckPermutation = function (s1, s2) {
+  let n1 = s1.length,
+    n2 = s2.length;
+  if (n1 != n2) return false;
+  let counter = {};
+  for (let i = 0; i < n1; i++) {
+    let cur1 = s1.charAt(i),
+      cur2 = s2.charAt(i);
+    counter[cur1] = (counter[cur1] || 0) + 1;
+    counter[cur2] = (counter[cur2] || 0) - 1;
+  }
+  return Object.values(counter).every((v) => v == 0);
 };
 ```
 

lcci/01.02.Check Permutation/Solution.py

@@ -3,7 +3,7 @@ def CheckPermutation(self, s1: str, s2: str) -> bool:
         n1, n2 = len(s1), len(s2)
         if n1 != n2:
             return False
-        counter = collections.Counter()
+        counter = Counter()
         for i in range(n1):
             counter[s1[i]] += 1
             counter[s2[i]] -= 1

lcci/01.04.Palindrome Permutation/README.md

@@ -36,7 +36,7 @@
 ```python
 class Solution:
     def canPermutePalindrome(self, s: str) -> bool:
-        counter = collections.Counter(s)
+        counter = Counter(s)
         cnt = 0
         for val in counter.values():
             if (val & 1) == 1:

lcci/01.04.Palindrome Permutation/README_EN.md

@@ -27,7 +27,7 @@
 ```python
 class Solution:
     def canPermutePalindrome(self, s: str) -> bool:
-        counter = collections.Counter(s)
+        counter = Counter(s)
         cnt = 0
         for val in counter.values():
             if (val & 1) == 1:

lcci/01.04.Palindrome Permutation/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def canPermutePalindrome(self, s: str) -> bool:
-        counter = collections.Counter(s)
+        counter = Counter(s)
         cnt = 0
         for val in counter.values():
             if (val & 1) == 1:

lcci/10.02.Group Anagrams/README.md

@@ -49,7 +49,7 @@
 ```python
 class Solution:
     def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
-        chars = collections.defaultdict(list)
+        chars = defaultdict(list)
         for s in strs:
             k = ''.join(sorted(list(s)))
             chars[k].append(s)

lcci/10.02.Group Anagrams/README_EN.md

@@ -48,7 +48,7 @@
 ```python
 class Solution:
     def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
-        chars = collections.defaultdict(list)
+        chars = defaultdict(list)
         for s in strs:
             k = ''.join(sorted(list(s)))
             chars[k].append(s)

lcci/10.02.Group Anagrams/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
-        chars = collections.defaultdict(list)
+        chars = defaultdict(list)
         for s in strs:
             k = ''.join(sorted(list(s)))
             chars[k].append(s)

lcci/16.02.Words Frequency/README.md

@@ -43,7 +43,7 @@ wordsFrequency.get("pen"); //返回1
 class WordsFrequency:
 
     def __init__(self, book: List[str]):
-        self.counter = collections.Counter(book)
+        self.counter = Counter(book)
 
     def get(self, word: str) -> int:
         return self.counter[word]