python练习5

     1.不死兔子

def rabbit(n):
    if n == 1 or n == 2:
        return 1
    return rabbit(n-1) + rabbit(n-2)


n = int(input("请输入月数："))
print(f"{n}个月后，有{rabbit(n)}对兔子")
    

     2.输入字符串，判断该字符串是否是回文字符串

def palindrome1(n):
    a = n[::-1]
    if n == a:
        print("是回文")
    else:
        print("不是回文")


def palindrome2(n):
    a = list(n)
    i = 0
    j = len(a) - 1
    while i < j:
        if a[i] != a[j]:
            return False
        i += 1
        j -= 1
    return True



n = input("请输入字符串：")
# palindrome1(n)
print(palindrome2(n))

    3.给定一个正整数N,找出1到N（含）之间所有质数的总和

def prime(n):
    if n == 2:
        return True
    for i in range(2, n // 2 + 1):
        if n % i == 0:
            return False
    return True
            

def count(n):
    sum = 0
    if n <= 1:
        return sum
    if n >= 2:
        for i in range(2, n+1):
            if prime(i):
                sum += i
    return sum


N = int(input("请输入正整数："))
print(f"1到{N}之间的质数和为{count(N)}")

    4.求  a+aa+aaa+.......+aaaaaaaaa=?其中a为1至9之中的一个数，项数也要可以指定。

def sum(a, n):
    result = 0
    current_term = a
    for i in range(n):
        result += current_term
        current_term = current_term * 10 + a
    return result


a = int(input("请输入a(1 - 9之间的一个数):"))
n = int(input("请输入项数："))
print(sum(a, n))

    5.合并两个有序数组，合并后还是有序列表

def merge_sorted(arr1, arr2):
    merged = []
    i, j = 0, 0
    while i < len(arr1) and j < len(arr2):
        if arr2[i] <= arr2[j]:
            merged.append(arr1[i])
            i += 1
        else:
            merged.append(arr2[j])
            j += 1
    merged.extend(arr1[i:])
    merged.extend(arr2[j:])
    return merged


arr1 = [1, 3, 5, 7, 9]
arr2 = [2, 4, 6, 8, 10]
print(merge_sorted(arr1, arr2))

    6.给定一个非负整数数组A，将该数组中的所有偶数都放在奇数元素之前

def sort_array(nums):
    left, right = 0, len(nums) - 1

    while left < right:
        if nums[left] % 2 == 0:
            left += 1
        elif nums[right] % 2 == 1:
            right -= 1
        else:
            nums[left], nums[right] = nums[right], nums[left]
            left += 1
            right -= 1

    return nums


nums = [3, 1, 2, 4, 6, 5, 7, 8]

sort_array(nums)
print("调整后的数组：", sort_array(nums))

    7.给定一个非负整数数组A，该数组的元素都是从1~N的元素组成，现在发现其中确实一个，请找出这个确实的元素
 

def missing_number(nums, N):
    sum_nums = sum(nums)
    sum_range = N * (N + 1) // 2
    missing_number = sum_range - sum_nums
    return missing_number


nums = [1, 2, 4, 5, 6]
N = 6

missing_number(nums, N)
print("确实的元素是：", missing_number(nums, N))