笔试题Python解决

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Giser_D/article/details/86686198

解决代码:

'''判断是否桌子可行'''
def judgeDeskFlag(n,str):
    if n == 1:
        print("False")
        return
    for i in range(n):
        if 2 <= n <= 3:
            if i < n-1:
                if str[i] == str[i + 1]:
                    print("False")
                    return
        else:
            if (str[0] == str[1] or str[n-1] == str[n-2]):
                print("False")
                return
            else:
                if i < n-2:
                    if (str[i] == str[i+1] and str[i+1] ==str[i+2]):
                        print("False")
                        return
                if i < n-1:
                    if (str[i] == str[i+1] and str[i] == '1'):
                        print("False")
                        return
    print("True")
    return

if __name__ == '__main__':
    n = int(input("请输入n:"))
    str = input("请输入字符串str:")
    print(len(str))
    while ((len(str) != n) or (n < 1 or n > 1000) or ((str.count('0') + str.count('1'))!= n)):
        n = int(input("请重新输入n:"))
        str = input("请重新字符串str:")
    judgeDeskFlag(n, str)


#turn to lower
def strToLower(str):
    cur_str = str.lower()
    print(cur_str)

str = input("FormalLetter:")
strToLower(str)

猜你喜欢

转载自blog.csdn.net/Giser_D/article/details/86686198