燕草如碧

分类

题解(60)

/ 注册

全部文章（共66篇）

题解 | #栈的压入、弹出序列#官方方法-改

去掉len(s)==0这个条件,直接把辅助栈底弄为-1,嘿嘿 class Solution: def IsPopOrder(self , pushV: List[int], popV: List[int]) -> bool: n = len(pushV) ...

Python3

2022-06-24

0 221

题解 | #数位五五#太简单了,解法随意

太简单了,解法随意 l,r = map(int,input().split()) sum2 = 0 for i in range(l,r+1): str1='' str1+=str(i) sum1 = 0 for j in str1: sum1+=i...

Python3

2022-06-23

3 504

题解 | #小乐乐计算函数#

easy n = list(map(int,input().split())) def fk(a,b,c): return max((a+b,b,c))/(max((a,b+c,c))+max((a,b,c+b))) print(fk(n[0],n[1],n[2]))

Python3

2022-06-23

0 265

题解 | #字符串操作#

抄作业,稍有改动 n,m =map(int,input().split()) str1 =[i for i in input()] for i in range(m): l,r,ch1,ch2 = input().split() for j in range(int(l)-1,int...

Python3

2022-06-23

1 346

题解 | #蛇形矩阵#JS用状态解决

既然没人用JS写,我就写了下,大家可以拿去copy copy看看 while(line=readline()){ var n = line.split(); let position = new Array(); let str1 = ""; ...

Javascript V8 Javascript Node HTML/CSS/JavaScript

2022-06-23

0 306

题解 | #蛇形矩阵#JS用状态解决

既然没人用JS写,我就写了下,大家可以拿去copy copy看看 while(line=readline()){ var n = line.split(); let position = new Array(); let str1 = ""; ...

Javascript V8 Javascript Node HTML/CSS/JavaScript

2022-06-23

0 305

题解 | #[NOIP2008]笨小猴#数据结构dic和set 注释详细

使用dic和set数据结构解出,详细可看注释 # 字典非手写，同学请注意 def isPrime(num):#判断质数的函数 if num == 1 or num ==0: return False for i in range(2,num): if ...

Python3

2022-06-23

1 460

题解 | #扫雷#有限状态机

想用有限状态机解的，但是算法循环多了，导致超时 row,col = map(int,input().split()) minetb = [[0 for _ in range (col)] for _ in range(row) ] state = 0 x,y=0,0 allstate = [[0,1...

Python3

2022-06-22

0 381

题解 | #井字棋#抄作业

楼上太牛,直接抄作业,改都不用改,太完美了,. l=[] for i in range(3): l.extend(input().split()) lk = ['K','K','K'] lb = ['B','B','B'] n=[l[0:3],l[3:6],l[6:9],l[0::3],l[...

Python3

2022-06-22

1 230

题解 | #杨辉三角#

我用遍历二维数组做出来的,楼上用append做出来实在佩服啊 n = int(input()) a = [[1 for _ in range(n)] for _ in range(n)] for i in range(0,n): for j in range(0,i+1): ...

Python3

2022-06-22

2 603