new file: bytedance/a替换函数.py

	new file:   bytedance/统计班级中的说谎者.py

bytedance/a替换函数.py

@@ -0,0 +1,7 @@
+def solution(s: str) -> str:
+    s = s.replace("a", "%100")
+    return s
+if __name__ == '__main__':
+    print(solution(s="abcdwa") == '%100bcdw%100')
+    print(solution(s="banana") == 'b%100n%100n%100')
+    print(solution(s="apple") == '%100pple')

bytedance/统计班级中的说谎者.py

@@ -0,0 +1,20 @@
+import bisect
+
+def solution(A):
+    A.sort()
+    ans = 0
+    for i in range(len(A)):
+        # 找到第一个大于A[i]的数的下标，用二分的库函数，类似于C++中的lower_bound
+        index = bisect.bisect_left(A, A[i] + 1)
+        if index - 1 >= len(A) - index:
+            ans += 1
+    return ans
+
+
+if __name__ == "__main__":
+    # Add your test cases here
+    print(solution([100, 100, 100]) == 3)
+    print(solution([2, 1, 3]) == 2)
+    print(solution([30, 1, 30, 30]) == 3)
+    print(solution([19, 27, 73, 55, 88]) == 3)
+    print(solution([19, 27, 73, 55, 88, 88, 2, 17, 22]) == 5)