擅长:python、mysql、java
<p>由于我们必须根据输入的需要继续多次,因此最好使用递归:</p>
<pre><code>alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
# retrieve position of a letter in the alphabet set
def position(letter):
pos = alpha.index(letter) + 1
return pos
# function to recursively find the column number
def column_number(label, n):
if n==1:
return position(label)
else:
return ((26**(n-1)) * position(label[0])) + column_number(label[1:], n-1)
# main code
label = input().upper()
n = len(label)
col_n = column_number(label, n)
print(col_n)
</code></pre>