Leetcode Algorithms

448. Find All Numbers Disappeared in an Array

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.




Firstly, the prerequisite is 1 ≤ a[i] ≤n; secondly, we compare nums[i] and nums[nums[i]-1]. If they are not the same, swap them. And then we validate the res vector by checking nums[i] and i+1. If they are not the same, then we store i+1 in the res vector


class Solution{    public:
vector<int> findDisappearedNumbers(vector<int>&nums){
vector<int> res;
for (int i = 0; i < nums.size(); ++i){
if (nums[i] != nums[nums[i] - 1]){
swap(nums[i], nums[nums[i] - 1]);
-- i;
for (int i = 0; i < nums.size(); ++i){
if (nums[i] != i + 1){
res.push_back(i + 1);
return res;






My homepage to record my thought processes for solving SQL and Algorithm questions

Recommended from Medium

How Scott’s Cheap Flights is Using Ruby on Rails to Scale

Surprising Reasons Why WordPress is A Great CMS Choice For Enterprise Digital Publishing

ElasticAPM4D: Collecting software metrics in Delphi

LightBeam Data Lifecycle Management Platform

Robust, continuous audio recording:

GitLab CI/CD How-to

What code editor to choose

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store


In love with telling stories with data

More from Medium

HackerRank Algorithm

1155. Number of Dice Rolls With Target Sum

Identify Complete Binary Tree — Leetcode 958