下面是我的实现，它运行良好。
你应该打印出每一条可能的消息的优点，看看为什么你的程序输出它。

letterGoodness = dict(zip(string.ascii_uppercase,
                        [.0817,.0149,.0278,.0425,.1270,.0223,.0202,
                         .0609,.0697,.0015,.0077,.0402,.0241,.0675,
                         .0751,.0193,.0009,.0599,.0633,.0906,.0276,
                         .0098,.0236,.0015,.0197,.0007]))

trans_tables = [ str.maketrans(string.ascii_uppercase,
                 string.ascii_uppercase[i:]+string.ascii_uppercase[:i])
                 for i in range(26)]

def goodness(msg):
    return sum(letterGoodness.get(char, 0) for char in msg)

def all_shifts(msg):
    msg = msg.upper()
    for trans_table in trans_tables:
        txt = msg.translate(trans_table)
        yield goodness(txt), txt

print(max(all_shifts(input())))

我最后的解决方案是有效的，感谢出色的克里斯蒂安·丘皮图。

x = input()
NUM_LETTERS = 26 #Can't import modules I'm using a web based grader/compiler
def SpyCoder(S, N):
   y = ""
   for i in S:
      if(i.isupper()):
         x = ord(i)
         x += N
         if x > ord('Z'):
            x -= NUM_LETTERS
         elif x < ord('A'):
            x += NUM_LETTERS
         y += chr(x)
      else:
         y += " "
   return y

def GoodnessFinder(S):
   y = 0
   for i in S:
      if i.isupper():
         x = ord(i)
         x -= ord('A')
         y += letterGoodness[x]
      else:
         y += 1
   return y

def GoodnessComparer(S):
   goodnesstocompare = GoodnessFinder(S)
   goodness = 0
   v = ''
   best_v = S
   for i in range(0, 26):
     v = SpyCoder(S, i)
     goodness = GoodnessFinder(v)
     if goodness > goodnesstocompare:
         best_v = v
         goodnesstocompare = goodness
   return best_v

print(GoodnessComparer(x))

谢谢你所有的帮助!

我正在编写同一个教程，但使用了一个稍微不同的方法，这样就避免了创建和调用函数：

inp = input()     #to hold code text
code = list(inp)  #store code as a list
soln = []         #store the 'Goodness' for each of 26 possible answers
y=0               #variable to hold total goodness during calculations
clear = []        #will hold decoded text
pos=0             #position marker for a list

#for every possible value of shift
#note range as 0 to 25 are valid shifts and shift 26 = shift 0

for shift in range(0,26):
   for i in code:                  #loop through each letter in code
      if i == " ":                 #spaces have no score so omit them
         continue
      else:                        #if it's a letter
         x = ord(i)-shift          #apply the test shift
         if x < 65:                #prevent shifting outside A-Z range
            x = x + 26             
         x = x - 64                #turn ord into character position in A-Z with A=1
         x = letterGoodness[x-1]   #turn this into the Goodness score
         y = y + x                 #add this to a running total
   soln.insert(shift-1,y)          #AFTER decoding all letters in code, add total(y) to list of scores
   y = 0                           #reset y before next test value

bestSoln=max(soln)                 #find highest possible score

for i in range(0,26):              #check the list of solutions for this score
   if soln[i]==bestSoln:           #the position in this list is the shift we need
       bestShift = i+1             #+1 as the first solution is 0

for i in code:                     #now decode the original text using our best solution
   if i == " ":                    #spaces are not encoded so just add these to the string
      clear.insert(pos," ")        #pos used to track next position for final string
      pos = pos + 1
      continue
   else:
      x = ord(i)-bestShift         #same operation as before
      if x < 65:
         x = x + 26
   z = chr(x)
   clear.insert(pos,z)             #add the decoded letter to the clear text
   pos = pos + 1
print("".join(clear))              #join the list of clear text into one string and print it

请注意，此代码的许多部分可以（也应该）进行压缩，例如

x = x - 64
x = letterGoodness[x-1]
y = y + x

它们被扩展到“显示我的工作”，作为教程练习。

letterGoodness = {'A': 8.17, 'B': 1.49, 'C': 2.78, 'D': 4.25, 'E': 12.70,
                  'F': 2.23, 'G': 2.02, 'H': 6.09, 'I': 6.97, 'J': 0.05, 
                  'K': 0.77, 'L': 4.02, 'M': 2.41, 'N': 6.75, 'O': 7.51, 
                  'P': 1.93, 'Q': 0.09, 'R': 5.99, 'S': 6.33, 'T': 9.06, 
                  'U': 2.76, 'V': 0.98, 'W': 2.36, 'X': 0.15, 'Y': 1.97, 
                  'Z': 0.07} 
                  
# em - input message
em = str(input()) 
em = em.upper()

# dm - guess message
dm = '' 
dmList = []
goodnessList = []
shift = 1

for g in range(25):
   goodness = 0
   dm = ''
   for i in em:
       newL = chr(ord(i) - shift)
       if i == ' ':
            dm += i

       elif ord(newL) < 65:
               A = ord(newL) + 90
               newL = chr(A - 64)
               dm += newL

       else:
            dm += newL

   for h in dm:
      if h != ' ':
         goodness += letterGoodness[h]
   goodnessList.append(goodness)
         
   shift += 1
   dmList.append(dm)  

highestG = max(goodnessList)
dmind = goodnessList.index(highestG)
print(dmList[dmind])

def start():
   message = input()                                        ## collect user input
   maxGoodness = 0                                          ## stablish a benchmark
   maxGoodnessMessage = message                             ## use current message as baseline
   for i in range(0,26):                                    ## for each range of 1-26 the range of the alphabet and goodness
      currentMessage = decodeMesssage(message, i)           ## decode the message for the current i
      currentGoodness = calculateGoodness(currentMessage)   ##  calculate the goodness for decoded message
      if currentGoodness > maxGoodness:                     ## compare goodness to last iteration, if greater
         maxGoodness = currentGoodness                      ## update maxGoodness
         maxGoodnessMessage = currentMessage                ## store decipher message with current max goodness
         
   print(maxGoodnessMessage)

def decodeMesssage(message, S):                             ## decode message
   newMessage = ''                                          ## start with an empty message 
   for letter in message:                                   ## for each letter in the message 
      if ord(letter) == 32:                                 ## if we get an empty character just add it to the message and continue to next iteration
        newMessage = newMessage + letter
        continue
      currentAscii = ord(letter) + S                        ## calculate the value of the current letter and add the S= value
      if currentAscii > 90:                                 ## if the value of current letter + S is 90 meaning letter Z
         currentAscii = currentAscii-26                     ## find next letter starting from A
      newMessage += str(chr(currentAscii))                  ## transform back to a letter and add to message
   return newMessage 
 
def calculateGoodness(message): 
   total = 0
   for char in message:                                     ## for each character in the message
      if char == ' ':                                       ## ignore empty characters
         continue
      i = ord(char)
      total += letterGoodness[i-65]                        ## calculate the  value of the character and add it to total
   return total
      
   
   
start()