语法:str.replace(old,new,max)
old – 将被替换的字符串
new–新字符串 ,用于替换old字符串
max–字符串替换次数不超过max次
string = "this is string example....wow!!! this is really string"
print(string.replace("is", "was"))
print(string.replace("is", "was", 3)) # 替换不超过三次
# thwas was string example....wow!!! thwas was really string
# thwas was string example....wow!!! thwas is really string
剑指offer 05.替换空格题目链接
class Solution(object):
def replaceSpace(self, s):
"""
:type s: str
:rtype: str
"""
return s.replace(" ","%20")
Leetcode20 有效的括号 题目链接(华为,字节,bilibili都出过)
方法一:使用str.replace()
这个方法相当于巧解
def isValid(s:str):
while '()' in s or '[]' in s or '{}'in s:
s = replace('()','')
s = replace('[]','')
s = replace('{}','')
return s==''
举几个例子:
- s = “()[)]”,首先会将最前面的"()“替换成”",之后不存在一个完整的"()","[]“或者”{}",所以s=="" 返回Fasle,因为此时 s = “[(]”
- s = “[()]”,首先会将里面的"()“转换为”",之后s = “[]”,继续将"[]“替换为”",故此时s="" ,s==""返回True
方法二:构建辅助栈,这个方法也是解决括号匹配最经典也是最典型的方法
def isValid(s:str):
stack = [] # 构建一个辅助栈
for i in s:
if i == "(":
stack.append(")")
elif i == "[":
stack.append("]")
elif i == "{":
stack.append("}")
elif not stack or stack[-1] != i: # 如果栈为空或者栈顶元素不等于当前的字符,那么返回False
return False
else:
stack.pop() # 栈顶元素出栈
return True if not stack else False # 如果栈为空就返回True,否则返回False,防止只有一个字符的情况
举几个例子,分析一下code
- 如果s = “(”,这种情况,遍历s后,此时stack =[")"],此时最后的一行运行时,返回False,防止了只有一个字符的情况
- 如果s = “)”,这种情况,遍历s时,stack = [] ,故当not stack 时,返回False
- 如果s = “([)]“时,首先遍历s,遇到”(”,stack.append(")"),遇到"[" ,stack.append("]"),故此时 stack = [")","]"],此时 i = “)”,stack[-1]! = i,故返回False
如果没理解的话,直接去leetcode 或者ide上debug一下就好了
方法三:栈配合字典,速度最快
def isValid(s:str):
stack = ["?"]
dic = {"(":")","[":"]","{":"}","?":"?"}
for c in s:
if c in dic: # 如果dic中存在c这个键
stack.append(c) # 将c插入栈顶
elif dic[stack.pop()] != c: # 栈顶元素出栈并判断其的键值是否等于c
return False
return len(stack)==1
这个方法很巧妙,没有平时的积累估计面试的时候很难想到(只于我而言),还是举上述相同的例子,分析一下code为什么可以通过
- 如果s = “(”,这种情况,首先遍历s,此时 “(“在dic中,故将”(“添加到栈顶,stack = [”?”,"("],长度不为1,返回False
- 如果s = “)”,这种情况,遍历s时,stack = ["?"] , dic["?"] = “?” != “)”,故返回False
- 如果s = “([)]“时,首先遍历s,遇到”(”,stack.append("("),遇到"[" ,stack.append("["),故此时 stack = ["?","(","["],然而遍历到c = “)“时,dic[”[”] = “]” != “)”,故返回False
如果没理解的话,直接去leetcode 或者ide上debug一下就好了