摘要:
这题有点头疼 第一轮解法:暴力一轮轮计算 class Solution: def countAndSay(self, n: int) -> str: num = '1' r = 0 #轮数 count=0 #统计数字个数 now = '1' result = '' if n == 1: return 阅读全文
posted @ 2021-05-31 16:43
泊鸽
阅读(65)
评论(0)
推荐(0)
摘要:
1.先判断是否在内,再逐个搜索 class Solution: def strStr(self, haystack: str, needle: str) -> int: length = len(needle) if length == 0: return 0 if needle in haysta 阅读全文
posted @ 2021-05-31 15:53
泊鸽
阅读(74)
评论(0)
推荐(0)

浙公网安备 33010602011771号