摘要：
def jumpFloor(number): if number == 1 or number == 2: return number n, m = 1, 2 for i in range(number-2): result = m + n n, m = m, result return resul 阅读全文
摘要：
import math def distance(n,m,l): d = math.sqrt(n**2+m**2+l**2) return d x,y,z=input().split(",") d=distance(float(x),float(y),float(z)) print("{:.2f}" 阅读全文
摘要：
def isPrime(n): if n==2: return True else: for i in range(2,n+1): if n%i==0: return False else: return True num=int(input()) if isPrime(num): print("y 阅读全文
摘要：
class Solution(object): def romanToInt(self, s): sum=0 convert={'M': 1000,'D': 500 ,'C': 100,'L': 50,'X': 10,'V': 5,'I': 1} for i in range(len(s)-1): 阅读全文