各种for循环算法

冒泡排序

ls = [23, 2, 55, 12, 100, 3, 4, 77, 0, 1]

for i in range(len(ls)):
    for j in range(len(ls)-i-1):
        if ls[j] > ls[j+1]:
            ls[j], ls[j+1] = ls[j+1], ls[j]

print("冒泡排序的结果为:", ls)

递归

def fabo(n):
    if n == 0:
        return 0
    if n == 1:
        return 1
    else:
        return fabo(n-1) + fabo(n-2)
n=15
print("第%d项的值为:" % n, fabo(n))
# 1, 1, 2, 3, 5, 8, 13, 21, 34 ......

给定一个字符串求该字符串的对称串并输出

str="gooooglebannab"
for i in range(len(str)):
    for j in range(i+1, len(str)):
        for k in range(j+1, len(str)+1):
            if str[i:j] == str[j:k][::-1]:

                print(str[i:k])

给定一个数组求, 给定一个target的值求哪两个数相加等于这个target并输出索引

a = [4,4,6,7,2]
target = 8
for i in range(len(a)):
    for j in range(i+1, len(a)):
        if a[i] + a[j] == target:
            print(i, j)

输出一个数组中的任意三个数，和为0

ls = [3, -1, -3, 4, -2, 5]
for i in range(len(ls)):
    for j in range(i+1, len(ls)):
        for k in range(j+1, len(ls)):
            if ls[i] + ls[j] + ls[k] == 0:
                print(i, j, k)