task4

list1 = [2,5,6,7,8,9,2,9,9]

list1.append(15)
print(list1)

[2, 5, 6, 7, 8, 9, 2, 9, 9, 15]

list1.insert(5,20)
print(list1)

[2, 5, 6, 7, 8, 20, 9, 2, 9, 9, 15]

list2 = [2,5,6]
list1.extend(list2)
print(list1)

[2, 5, 6, 7, 8, 20, 9, 2, 9, 9, 15, 2, 5, 6]

list1.pop(3)
print(list1)

[2, 5, 6, 8, 20, 9, 2, 9, 9, 15, 2, 5, 6]

list1.reverse()
print(list1)

[6, 5, 2, 15, 9, 9, 2, 9, 20, 8, 6, 5, 2]

list1.sort()
print(list1)
list1.sort(reverse = True)
print(list1)

[2, 2, 2, 5, 5, 6, 6, 8, 9, 9, 9, 15, 20]
[20, 15, 9, 9, 9, 8, 6, 6, 5, 5, 2, 2, 2]

def DoubleList(lst):
    for index,value in enumerate(lst):
        
        if isinstance(value,bool):
            continue
        elif isinstance(value,(int,float)):
            lst[index] = value*2
        elif isinstance(value,list):
            DoubleList(value)
        else:
            continue

lst = [1,[4,6],True]
DoubleList(lst)
print(lst)

[2, [8, 12], True]

isinstance(True,(int,float))

True

def Peak(lst):
    PeakLst =True
    PeakFlg = False
    value_pre = lst[0]
    for i in range(1,len(lst)):
        if (lst[i]>lst[i-1]) and PeakLst:
            PeakIndex = i
        elif lst[i]<lst[i-1]:
            PeakLst =False
            PeakFlg = True
        else:
            PeakFlg = False
            break
    return PeakFlg,i 
            

lst =[1,3,1]
PeakFlg,i = Peak(lst)
print(PeakFlg,i)

True 2

lst =[1,3,4]
PeakFlg,i = Peak(lst)
print(PeakFlg,i)

False 2

lst =[1,3,4,1]
PeakFlg,i = Peak(lst)
print(PeakFlg,i)

True 3

lst =[1,3,4,4,1]
PeakFlg,i = Peak(lst)
print(PeakFlg,i)

False 3

print((1,2)*2)
print((1,)*2)
print((1)*2)

(1, 2, 1, 2)
(1, 1)
2

不属于拆包

str = " python is beautiful!"

str.replace("i","I")

' python Is beautIful!'

str.split()

['python', 'is', 'beautiful!']

str.lstrip()

'python is beautiful!'

def isdigit(str):
    digitflg = True
    for i in range(len(str)):
        if str[i].isnumeric():
            continue
        else:
            digitflg = False
            break
    return digitflg
        

isdigit("124")

True

isdigit("1fa")

False

 def longestPalindrome(s):
 
        T = '$'+'#'+'#'.join(s)+'#'+'&' 
        n = len(T)
        P = [0] * n  
        C = R = 0    
        for i in range (1, n-1):
            P[i] = (R > i) and min(R - i, P[2*C - i]) # equals to i' = C - (i-C)
            while T[i + 1 + P[i]] == T[i - 1 - P[i]]:
                P[i] += 1
            if i + P[i] > R:
                C, R = i, i + P[i]

        maxLen, centerIndex = max((n, i) for i, n in enumerate(P))
        return s[(centerIndex  - maxLen)//2: (centerIndex  + maxLen)//2]
        

longestPalindrome('sadda')

'adda'