未排序数组中的最小非连续数

def find_min_nonconsecutive(arr):
    min_val = arr[0]
    max_val = arr[0]
    
    # 找到最小值和最大值
    for num in arr:
        if num < min_val:
            min_val = num
        if num > max_val:
            max_val = num
    
    # 创建新数组
    new_arr = [False] * (max_val - min_val + 1)
    
    # 将未排序数组中的元素放入新数组
    for num in arr:
        new_arr[num - min_val] = True
    
    # 找到最小非连续数
    for i in range(len(new_arr)):
        if not new_arr[i]:
            return i + min_val
    
    return None

# 示例用法
arr = [3, 1, 4, 6, 7, 2]
min_nonconsecutive = find_min_nonconsecutive(arr)
print("未排序数组中的最小非连续数为:", min_nonconsecutive)