Shulou(Shulou.com)06/01 Report--

This article mainly explains "how leetcode finds the missing numbers in 0~n-1". The content in the article is simple and clear, and it is easy to learn and understand. Please follow the editor's train of thought to study and learn "how leetcode finds the missing numbers in 0~n-1".

All the numbers in an incrementally sorted array of length nmur1 are unique, and each number is within the range 0~n-1. There is only one of the n numbers in the range 0~n-1 that is not in the array. Please find this number.

Example 1:

Enter: [0Jing 1Pol 3]

Output: 2

Example 2:

Input: [0Jing 1, 2, 3, 4, 5, 6, 7, 9]

Output: 8

Restrictions:

one

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.