Leetcode 268. Missing Number || Intuition + Example + Code
ฝัง
- เผยแพร่เมื่อ 14 ต.ค. 2024
- Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?
Example 1:
Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
Example 2:
Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.
Example 3:
Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.
Mam could you pls explain by any single step representation is even more effective becoz I am not getting how the value stored in ans variable .
But mam, in your submission the brute-force approach is getting good result than bit manipulation approach in terms of time used.
Easy explained thankyou di ❤😊
2:50 Wasn''t the sum solution faster than 99% as compared to the ~50% or the XOR Solution ??
LC acceptance is not correct try submitting the same code of any problem it gives out different acceptance rate lol, rely on time complexity
Thank you😁
Thank you Alisha!
Nice Explanation!!!!!!!!
Very good👍
thanks !
thanks☺