add count_vowel plalindrome reverse_string

Author: BUGLAN

.gitignore

@@ -0,0 +1,4 @@
+__pycache__/
+*.py[cod]
+.pytest_cache/
+.mypy_cache/

text-operation/count_vowel.py

@@ -0,0 +1,22 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+"""
+    text-operation.count_vowel
+    --------------------------
+
+    统计元音字母——输入一个字符串，统计处其中元音字母的数量。更复杂点的话统计出每个元音字母的数量。
+    :copyright: (c) 2018-09-15 by buglan
+"""
+keys = {'a': 0, 'e': 0, 'i': 0, 'o': 0, 'u': 0}
+
+
+def count_vowel(string: str) -> dict:
+    for s in string:
+        if s in keys:
+            keys[s] += 1
+    return keys
+
+
+def test_count_vowel():
+    string = 'aeiiousdfsdfsdf'
+    assert count_vowel(string) == {'a': 1, 'e': 1, 'i': 2, 'o': 1, 'u': 1}

text-operation/plalindrome.py

@@ -0,0 +1,73 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+"""
+    text-operation.plalindrome
+    --------------------------
+
+    判断是否为回文——判断用户输入的字符串是否为回文。回文是指正反拼写形式都是一样的词，譬如“racecar”
+    :copyright: (c) 2018-09-15 by buglan
+"""
+from typing import List, Optional, Any
+
+
+class FullError(Exception):
+    pass
+
+
+class EmptyError(Exception):
+    pass
+
+
+class Stack:
+    def __init__(self, maxcount: Optional[int] = None) -> None:
+        self.items: List = []
+        self.maxcount = maxcount
+        if self.maxcount is not None and self.maxcount <= 0:
+            raise Exception("self.maxcount cann't <= 0")
+
+    def __len__(self) -> int:
+        return len(self.items)
+
+    def push(self, value: Any) -> None:
+        if self.maxcount is not None and len(self) >= self.maxcount:
+            raise FullError(f"len(self) >= {self.maxcount}")
+        self.items.append(value)
+
+    def pop(self) -> Any:
+        if len(self) <= 0:
+            raise EmptyError("len(self) <= 0")
+        return self.items.pop()
+
+    def is_empty(self) -> bool:
+        return len(self.items) == 0
+
+    def peak(self) -> Any:
+        if len(self) <= 0:
+            raise EmptyError("len(self) <= 0")
+        return self.items[-1]
+
+
+def is_plalindrome(string: str) -> bool:
+    length: int = len(string)
+    stack: 'Stack' = Stack(length // 2)
+    for i in range(length // 2):
+        stack.push(string[i])
+    s: str = ""
+    for i in range(length // 2):
+        s += stack.pop()
+    if len(string) // 2 == 0 and s == string[length // 2:]:
+        return True
+    elif s == string[length // 2 + 1:]:
+        return True
+    return False
+
+
+def test_is_plalindrome():
+    string = 'racecar'
+    assert is_plalindrome(string)
+    string = '妈妈爱我,我爱妈妈'
+    assert is_plalindrome(string)
+    string = 'aabb'
+    assert not is_plalindrome(string)
+    string = 'abba'
+    assert not is_plalindrome(string)

text-operation/reverse_string.py

@@ -0,0 +1,37 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+"""
+    text-operation.reverse_string
+    -----------------------------
+
+    反转字符串
+    :copyright: (c) 2018-09-13 by buglan
+"""
+from typing import List
+
+
+def reverse_string(string: str) -> str:
+    return string[::-1]
+
+
+def reverse_string2(string: str) -> str:
+    """
+    string is unmut type
+    so cann't use string[i] = ...
+    """
+    length: int = len(string)
+    strings: List[str] = list(string)
+    for i in range(length // 2):
+        strings[i], strings[length - i - 1] = strings[length - i -
+                                                      1], strings[i]
+    return "".join(strings)
+
+
+def test_reverse_string():
+    string = "abcde"
+    assert "edcba" == reverse_string(string)
+
+
+def test_reverse_string2():
+    string = "abcde"
+    assert "edcba" == reverse_string2(string)