solves string compression in python

Author: anishLearnsToCode

README.md

@@ -117,7 +117,7 @@
 | 422 | 🔒 [Valid Word Square](https://leetcode.com/problems/valid-word-square) | Easy | |
 | 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOfSegmentsInString.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/number_of_segments_in_a_string.py) |
 | 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ArrangingCoins.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/arranging_coins.py) |
-| 443 | [String Compression](https://leetcode.com/problems/string-compression) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/StringCompression.java) |
+| 443 | [String Compression](https://leetcode.com/problems/string-compression) | Medium | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/StringCompression.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/string_compression.py) |
 | 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOfBoomerangs.java) |
 | 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FindAllNumbersDisappearedInAnArray.java) |
 | 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MinimumMovesToEqualArrayElements.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/minimum_moves_to_equal_array_element.py) |

python/string_compression.py

@@ -0,0 +1,27 @@
+from typing import List
+from collections import deque
+
+
+class Solution:
+    def compress(self, chars: List[str]) -> int:
+        compressed_strings = deque()
+        current_char, count,length = chars[0], 0, 0
+        for character in chars:
+            if character == current_char:
+                count += 1
+            else:
+                compressed_strings.append((current_char, str(count)))
+                length += 1 + (len(str(count)) if count > 1 else 0)
+                current_char = character
+                count = 1
+        compressed_strings.append((current_char, str(count)))
+        length += 1 + (len(str(count)) if count > 1 else 0)
+
+        i = 0
+        for compressed_string in compressed_strings:
+            character, count = compressed_string
+            chars[i] = character
+            if int(count) > 1:
+                chars[i + 1:i + 1 + len(count)] = count
+            i += 1 + (len(count) if int(count) > 1 else 0)
+        return length