Merge branch 'main' of github.com:tkzzzzzz6/Algorithm_beginner_learning_notes

Author: ttkqwe123

leetcode/problems/3093.longest-common-suffix-queries.py

@@ -0,0 +1,29 @@
+#
+# @lc app=leetcode.cn id=3093 lang=python3
+# @lcpr version=30204
+#
+# [3093] 最长公共后缀查询
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+class Solution:
+    def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:
+        
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# ["abcd","bcd","xbcd"]\n["cd","bcd","xyz"]\n
+# @lcpr case=end
+
+# @lcpr case=start
+# ["abcdefgh","poiuygh","ghghgh"]\n["gh","acbfgh","acbfegh"]\n
+# @lcpr case=end
+
+#

leetcode/problems/3121.count-the-number-of-special-characters-ii.py

@@ -0,0 +1,51 @@
+#
+# @lc app=leetcode.cn id=3121 lang=python3
+# @lcpr version=30204
+#
+# [3121] 统计特殊字母的数量 II
+#
+
+
+# @lcpr-template-start
+
+# @lcpr-template-end
+# @lc code=start
+class Solution:
+    def numberOfSpecialChars(self, word: str) -> int:
+        ans = 0
+        state = [0]*27
+        for c in map(ord,word):
+            x = c & 31
+            if c & 32:
+                if state[x] == 0:
+                    state[x] = 1
+                elif state[x] == 2:
+                    state[x] = -1
+                    ans -=1
+            else:
+                if state[x] == 0:
+                    state[x] = -1
+                elif state[x] == 1:
+                    state[x] =2
+                    ans+=1
+            
+        return ans
+        
+# @lc code=end
+
+
+
+#
+# @lcpr case=start
+# "aaAbcBC"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "abc"\n
+# @lcpr case=end
+
+# @lcpr case=start
+# "AbBCab"\n
+# @lcpr case=end
+
+#