编程是一项实践性非常强的技能,理论知识固然重要,但实战经验同样不可或缺。通过解决各种编程题目,可以巩固你的编程基础,提升解决问题的能力。以下是一些实战题目,它们能够帮助你更好地掌握编程核心,轻松通关各种技术挑战。
1. 排序算法
冒泡排序
def bubble_sort(arr):
n = len(arr)
for i in range(n):
for j in range(0, n-i-1):
if arr[j] > arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]
return arr
快速排序
def quick_sort(arr):
if len(arr) <= 1:
return arr
pivot = arr[len(arr) // 2]
left = [x for x in arr if x < pivot]
middle = [x for x in arr if x == pivot]
right = [x for x in arr if x > pivot]
return quick_sort(left) + middle + quick_sort(right)
2. 数据结构
链表
class ListNode:
def __init__(self, value=0, next=None):
self.value = value
self.next = next
def linked_list_reverse(head):
prev = None
current = head
while current:
next_node = current.next
current.next = prev
prev = current
current = next_node
return prev
栈和队列
class Stack:
def __init__(self):
self.items = []
def is_empty(self):
return len(self.items) == 0
def push(self, item):
self.items.append(item)
def pop(self):
return self.items.pop()
class Queue:
def __init__(self):
self.items = []
def is_empty(self):
return len(self.items) == 0
def enqueue(self, item):
self.items.insert(0, item)
def dequeue(self):
return self.items.pop()
3. 字符串处理
反转字符串
def reverse_string(s):
return s[::-1]
查找子串
def find_substring(s, sub):
return s.find(sub)
4. 算法问题
最大子数组和
def max_subarray_sum(arr):
max_current = max_global = arr[0]
for i in range(1, len(arr)):
max_current = max(arr[i], max_current + arr[i])
if max_current > max_global:
max_global = max_current
return max_global
股票买卖最佳时机
def max_profit(prices):
min_price = float('inf')
max_profit = 0
for price in prices:
min_price = min(min_price, price)
max_profit = max(max_profit, price - min_price)
return max_profit
通过以上实战题目,你可以巩固编程基础,提升解决问题的能力。记住,编程是一项需要不断练习和积累经验的技能,多做题、多思考,你一定会越来越厉害!
