对相邻元素进行操作的标准算法

def max_sum_subarray(arr, window_size):
    if window_size > len(arr):
        return None
    max_sum = float('-inf')
    current_sum = sum(arr[:window_size])
    for i in range(window_size, len(arr)):
        current_sum += arr[i] - arr[i - window_size]
        max_sum = max(max_sum, current_sum)
    return max_sum

# 示例
arr = [1, 2, 3, 4, 5]
window_size = 3
print(max_sum_subarray(arr, window_size))  # 输出: 12 (3+4+5)

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

# 示例
arr1 = [1, 3, 5]
arr2 = [2, 4, 6]
print(merge_sorted_arrays(arr1, arr2))  # 输出: [1, 2, 3, 4, 5, 6]

# 邻接矩阵示例
adj_matrix = [
    [0, 1, 1, 0],
    [1, 0, 0, 1],
    [1, 0, 0, 1],
    [0, 1, 1, 0]
]

# 邻接表示例
adj_list = {
    0: [1, 2],
    1: [0, 3],
    2: [0, 3],
    3: [1, 2]
}

def bfs(graph, start):
    visited = set()
    queue = [start]
    while queue:
        vertex = queue.pop(0)
        if vertex not in visited:
            print(vertex, end=' ')
            visited.add(vertex)
            queue.extend(graph[vertex] - visited)

# 示例
print("BFS Traversal:")
bfs(adj_list, 0)  # 输出: 0 1 2 3