Excel列数

最长回文子串

表达式运算

当n=953时，本来应该输出13的。。。但是答案是12。。。克服下这个就过了

注意953这个数

def f(n): &nbsp; &nbsp; t=len(bin(n)[2:])-1 &nbsp; &nbsp; t2=t &nbsp; &nbsp; n=n-2**t &nbsp; &nbsp; L=[] &nbsp; &nbsp; for i in range(t+1): &nbsp; &nbsp; &nbsp; &nbsp; L.append(2**i) &nbsp; &nbsp; &nbsp; &nbsp; L.append(-2**i) &nbsp; &nbsp; S=[-1 for i in range(2**t+1)] &nbsp; &nbsp; S[0]=0 &nbsp; &nbsp; S2=S[:] &nbsp; &nbsp; while S2[n]==-1: &nbsp; &nbsp; &nbsp; &nbsp; t=t+1 &nbsp; &nbsp; &nbsp; &nbsp; for i in range(2**t2+1): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if S2[i]&lt;&gt;-1: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for j in L: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if j+i&gt;0 and j+i&lt;2**t2+1 and S2[j+i]==-1: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; S[j+i]=0 &nbsp; &nbsp; &nbsp; &nbsp; S2=S[:] &nbsp; &nbsp; return t print f(n)

注意你的t=len(bin(n)[2:])-1这种语句
明确写的很清楚不需要赋值
系统会自动赋值

自己测试都是对的，就是过不了

L = [1,2,4,8,16,32,64,128,256,512,1024] sum = 0 for i in range(10): &nbsp; &nbsp; if(n==L[i]):print(i) &nbsp; &nbsp; elif(n&gt;L[i] and n&lt;L[i+1]): &nbsp; &nbsp; &nbsp; &nbsp; if(n&lt;=(L[i]+L[i+1])/2): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum=i &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n = n-L[i] &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for j in range(i-1,-1,-1): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(n-L[j]&gt;=0): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n = n-L[j] &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum+=1 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum=i+1 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n = L[i+1]-n &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for j in range(i-1,-1,-1): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(n-L[j]&gt;=0): &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n = n-L[j] &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum+=1 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; print(sum)

测试没问题，就是通过不了

base = [1] def bigger(base = base): 	l = [i+j for i in base for j in base] 	m = [i*j for i in base for j in base] 	n = [abs(i-j) for i in base for j in base if i!=j] 	p = [i//j for i in base for j in base if i%j==0] 	return list(set(base+l+m+n+p)) def count(n): 	if n == 1:return 0 	num = 0 	global base 	while n not in base: 		base = bigger(base) 		num+=1 	else: 		return num print count(31)

其实这样写是可以的，就是不知道要怎么让编译器知道我的函数

# 看二进制一多还是0多 # 31 = b'11111' # 第一算法：o1 = 5-1 + (1的个数-1) # 第二算法：o2 = 6-1 + 1 + (0的个数) l = [] while n&gt;=2: &nbsp;&nbsp;&nbsp; l.append(n%2) &nbsp;&nbsp;&nbsp; n = n//2 l.append(n) o1 = len(l)-1 + l.count(1)-1 o2 = len(l) + 1 + l.count(0) # print l, o1, o2 print min(o1,o2)

第165题：表达式运算

正方形拼接

回文数 I

整数编码

砝码问题