Hj21 simple password

Knowledge point ： character string simulation

describe
Now there is a cipher transformation algorithm .
The correspondence between numbers and letters on the nine key mobile phone keyboard ： 1–1, abc–2, def–3, ghi–4, jkl–5, mno–6, pqrs–7, tuv–8 wxyz–9, 0–0, Change the lowercase letters in the password into the numbers corresponding to the nine key keyboard , Such as ：a become 2,x become 9.
And the uppercase letters in the password become lowercase and then move back one bit , Such as ：X , Change to lowercase first , One more step back , Turned into y , exception ：Z Moving back is a .
Numbers and other symbols are not transformed .
Data range ： The length of the input string meets the requirements 1≤n≤100
Input description ：
Enter a set of passwords , Length not exceeding 100 Characters .

Output description ：
Output the string after password transformation

Example 1

 Input ：YUANzhi1987
 Output ：zvbo9441987

Cattle guest HJ Python

#  The elapsed time 42ms  Take up memory 4700KB
# a:97 z:122 0: 49 9:57
s = input()
for i in s:
    if ord(i) >= 97 and ord(i) <= 122:
        if i in "abc":
            print("2",end="")
        if i in "def":
            print("3",end="")
        if i in "ghi":
            print("4",end="")
        if i in "jkl":
            print("5",end="")
        if i in "mno":
            print("6",end="")
        if i in "pqrs":
            print("7",end="")
        if i in "tuv":
            print("8",end="")
        if i in "wxyz":
            print("9",end="")
    elif ord(i) >= 65 and ord(i) < 90:
        print(chr(ord(i.lower())+1),end="")
    elif ord(i) == 90:
        print("a",end="")
    else:
        print(i,end="")

Link to the original text ：
https://www.920vip.net/article/184