New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Day399: 如何找到数组中第一个没出现的最小正整数怎么优化（字节） #402

Open

qappleh opened this issue Sep 16, 2021 · 0 comments

Labels

字节跳动数据结构与算法编程题

Owner

qappleh commented Sep 16, 2021

给你一个未排序的整数数组 nums ，请你找出其中没有出现的最小的正整数。
请你实现时间复杂度为 O(n) 并且只使用常数级别额外空间的解决方案。

示例 1：

输入：nums = [1,2,0]
输出：3

示例 2：

输入：nums = [3,4,-1,1]
输出：2

示例 3：

输入：nums = [7,8,9,11,12]
输出：1

这是一道字节的算法题目的在于不断地去优化算法思路

The text was updated successfully, but these errors were encountered:

qappleh added 字节跳动数据结构与算法编程题 labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment