广州中学人工智能课程培训平台有名推荐

def hello_world(): print("Hello, World!")

def add_numbers(a, b): return a + b

def max_number(a, b): return max(a, b)

def sum_range(start, end): return sum(range(start, end+1))

def is_even(number): return number % 2 == 0

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

def factorial(n): if n == 0: return 1 return n * factorial(n-1)

def is_prime(number): if number < 2: return False for i in range(2, int(number**0.5)+1): if number % i == 0: return False return True

def fibonacci_sequence(length): sequence = [0, 1] while len(sequence) < length: sequence.append(sequence[-1] + sequence[-2]) return sequence

def is_in_list(number, lst): return number in lst

def average(lst): return sum(lst) / len(lst)

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

import math def circle_area(radius): return math.pi * radius**2

def replace_vowels(string, char): vowels = "aeiouAEIOU" for vowel in vowels: string = string.replace(vowel, char) return string

def compound_interest(principal, rate, time): return principal * (1 + rate/100)**time

def count_characters(string): char_count = {} for char in string: if char in char_count: char_count[char] += 1 else: char_count[char] = 1 return char_count

def get_odd_numbers(lst): return [num for num in lst if num % 2 != 0]

def contains_substring(string, substring): return substring in string

def reverse_list(lst): return lst[::-1]

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