一个萝卜一个坑

表达式运算

Excel列数

def get_column_name(n):     column_name = &quot;&quot; while n &gt; 0:         n -= 1         column_name = chr(n % 26 + ord(&quot;A&quot;)) + column_name         n //= 26 return column_name print(get_column_name(n))

ChatGPT的解法

<pre><code>s = &#x27;&#x27; while n:     temp = (n-1) % 26     s += chr(temp + 65 )     n //= 26 #n = 26会输出&#x27;ZA&#x27;显然不对应该改成&#x27;Z&#x27; if &#x27;ZA&#x27; in s:     s = s.replace(&#x27;ZA&#x27;,&#x27;Z&#x27;) print(s[::-1])</code></pre>

注意n=26情况

<pre style="font-family: Consolas; font-size: 9.8pt;">re=&quot;&quot;
while n&gt;0:
 re+=chr((n-1)%26+65)
 n=(n-1)//26
print(re[::-1])</pre>

26是个坎

大家试试看n=52就知道了，其实excel满怪的，没有字母表示0，A是1，所以，2倍的26，不是B0，二是AZ，A是26，Z也是26 所以，还是傻一点的办法好 s='' n=n-1 &nbsp; #, 则输出：Z m=n%26 n=n/26 s=s+chr(m+ord('A')) while n: &nbsp;&nbsp;&nbsp; m=n%26 &nbsp;&nbsp;&nbsp; n=n/26 &nbsp;&nbsp;&nbsp; s=chr(m-1+ord('A'))+s print s <pre class="prettyprint lang-py linenums">s=''
n=n-1
 #, 则输出：Z
m=n%26
n=n/26
s=s+chr(m+ord('A'))
while n:
 m=n%26
 n=n/26
 s=chr(m-1+ord('A'))+s
print s</pre> <div style="top: 0px;">﻿﻿</div>

其实我想说，之前的报告都错了

L=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'] M=[] while n&gt;26: &nbsp; &nbsp; M.append(L[n%26-1]) &nbsp; &nbsp; n=n//26 M.append(L[n-1]) M.reverse() print(''.join(M))

找规律

<pre style="font-family: 宋体; font-size: 12pt;">column = ''
while n &gt; 0:
 column += str(chr(n % 26 + 64))
 n = n // 26
print(column[::-1])</pre>

这个解法提交后，一直提示答案错误，求大神帮忙看看是什么原因

r=[] while n&gt;0: &nbsp; &nbsp; t=(n-1)%26 &nbsp; &nbsp; r.append(chr(65+t)) &nbsp; &nbsp; n=(n-1)//26 print(''.join(x for x in r[::-1]))

l = [] while n&gt;26: &nbsp;&nbsp;&nbsp; l.append(n%26) &nbsp;&nbsp;&nbsp; n = n//26 l.append(n%26) print ''.join(chr(ord('A')+(i+25)%26) for i in l[::-1])

26进制转换

import string def baseN(num): &nbsp; &nbsp; if num &lt;= 26: &nbsp; &nbsp; &nbsp; &nbsp; return string.ascii_uppercase[num - 1] &nbsp; &nbsp; else: &nbsp; &nbsp; &nbsp; &nbsp; return baseN(num // 26) + string.ascii_uppercase[num % 26 - 1] print baseN(n)

test

def num2col(n): &nbsp; &nbsp; l = [] &nbsp; &nbsp; while n&gt;26: &nbsp; &nbsp; &nbsp; &nbsp; l.append(chr(n%26+ord('A')-1)) &nbsp; &nbsp; &nbsp; &nbsp; n = n//26 &nbsp; &nbsp; l.append(chr(n+ord('A')-1)) &nbsp; &nbsp; return ''.join(l[::-1]) print(num2col(n))

def recursion(n): if  n &lt;= 26: return chr(n%26+64) else: return chr(n%26+64) + recursion(n//26) print(recursion(n)[::-1])

递归应该没问题的

abc=&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZ&quot; def system(n): &nbsp; &nbsp; n=n-1 &nbsp; &nbsp; result=[] &nbsp; &nbsp; while n/26!=0: &nbsp; &nbsp; &nbsp; &nbsp; result.append(n%26) &nbsp; &nbsp; &nbsp; &nbsp; n=n/26 &nbsp; &nbsp; result.append(n) &nbsp; &nbsp; return result[::-1] result_number=system(n) if len(result_number)&gt;1: &nbsp; &nbsp; head=result_number[:-1] &nbsp; &nbsp; head_fix=[j-1 for j in head] &nbsp; &nbsp; tail=result_number[-1:] &nbsp; &nbsp; number=head_fix+tail else: &nbsp; &nbsp; number=result_number &nbsp; &nbsp;&nbsp; result_abc=[abc[i] for i in number] print ''.join(result_abc)

第166题：Excel列数

基因串

公约数的个数

最大非连续子序列

约瑟夫问题