五道基础且高频的Python算法面试题

def reverse_string(s):
    return s[::-1]

input_str = "hello"
reversed_str = reverse_string(input_str)
print(reversed_str)  # 输出 "olleh"

def is_palindrome(s):
    return s == s[::-1]

input_str = "radar"
result = is_palindrome(input_str)
print(result)  # 输出 True

def fibonacci(n):
    if n <= 1:
        return n
    else:
        return fibonacci(n-1) + fibonacci(n-2)

result = fibonacci(5)
print(result)  # 输出 5

def find_max_element(lst):
    return max(lst)

numbers = [3, 5, 7, 2, 8]
max_number = find_max_element(numbers)
print(max_number)  # 输出 8

def count_characters(s):
    char_count = {}
    for char in s:
        char_count[char] = char_count.get(char, 0) + 1
    return char_count

input_str = "hello"
result = count_characters(input_str)
print(result)  # 输出 {'h': 1, 'e': 1, 'l': 2, 'o': 1}