设定现在有一个字符串 str = "hello, kitty is not cat": 假设要把其中的 is 变成红色样式: 先自定义一个函数 red(); red(str,redstr)函数传递两个参数,一个是整个字符串,另一个是要变样式的字符串. var str = "hello, kitty is not cat"; var red = (a, redstr = "参数默认") => { let zzr = new RegExp(&q
题目描述 Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V', E'), with the following prope
列表生成式: a=[x for x in range(10)] b=[x*2 for x in range(10)] def f(n): return n**3 c=[f(x) for x in range(10)] print(a,'\n',b,'\n',c) 一种简单赋值法: t=[12,'f',4] #元组.列表都可以 a,b,c=t print(a,b,c) 生成器的两种创建方式: 方式一: s=(x for x in range(10)) #创建一个生成器 print(s) print