06、字符串

第四题：Give two strings A and B, return the length of the longest B’s substring in A, if none return -1

str = input().split(",")
A = str[0]
B = str[1]
max = 0
for i in range(len(A)):
    for j in range(len(B)):
        if A[i] == B[j]:
            k = 0
            while i+k < len(A) and j+k < len(B) and A[i+k] == B[j+k]:
                k += 1
            if k > max:
                max = k
if max == 0:
    print(-1)
else:
    print(max)

第五题：Count the maximum number of letters in the input string, and output the number

str = input()
count = 0
max = 0
for i in range(len(str)):
    for j in range(len(str)):
        if str[i] == str[j]:
            count +=1

        if count > max:
            max = count
    count = 0
print(max)

第六题：Given positive integers N, x, Calculate how many times the number x (0≤x≤9) occurs in all integers from 1 to N

N_list = [int(i) for i in input().split(",")]
N = N_list[0]
x = N_list[1]
x = str(x)
count = 0
for i in range(1, N+1):
    c = str(i)
    for j in range(0, len(c)):
        if x == c[j]:
            count += 1
print(count)