LeetCode
自由的行走
向着有光的地方出发!!!
展开
-
Implement Trie (Prefix Tree)前缀树系列
208.Implement Trie (Prefix Tree)class Trie: def __init__(self): """ Initialize your data structure here. """ self.tree = [] def insert(self, wo...原创 2019-11-11 21:08:57 · 86 阅读 · 0 评论 -
LeetCode 686. Repeated String Match
class Solution: def repeatedStringMatch(self, A: str, B: str) -> int: if set(A)<set(B): #如果字符串B中出现A中没有的元素 则无论如何重复都不可能 直接返回-1 return -1 for i in range(1,int(len(B)...原创 2019-08-03 16:36:24 · 93 阅读 · 0 评论 -
LeetCode 1108. Defanging an IP Address
import reclass Solution: def defangIPaddr(self, address: str) -> str: """这个简单 正则字符串 替换""" return re.sub("\.","[.]",address)提交时间:2019-08-03 16:48...原创 2019-08-03 16:49:14 · 114 阅读 · 0 评论 -
LeetCode 859. Buddy Strings
class Solution: def buddyStrings(self, A: str, B: str) -> bool: """有且仅有2个字符交换后 让A&B相等""" if len(A)!=len(B): return False if A==B: if len(A)&...原创 2019-08-03 17:41:35 · 85 阅读 · 0 评论 -
LeetCode 125. Valid Palindrome
class Solution(object): def isPalindrome(self, s): """ :type s: str :rtype: bool """ intable=string.punctuation outtable=" "*len(intable) ...原创 2019-08-14 18:01:40 · 84 阅读 · 0 评论 -
LeetCode 1154. Day of the Year
import datetimeclass Solution: def dayOfYear(self, date: str) -> int: time=date.split("-") year=int(time[0]) mon=int(time[1]) day=int(time[2]) d1 = dat...原创 2019-08-14 22:44:34 · 246 阅读 · 0 评论