Let Code Day21 Starting from Zero "448. Find All Numbers Disappeared in an Array"

Overview

It seems that coding tests are conducted overseas in interviews with engineers, and in many cases, the main thing is to implement specific functions and classes according to the theme.

As a countermeasure, it seems that a site called Let Code will take measures.

A site that trains algorithmic power that can withstand coding tests that are often done in the home.

I think it's better to have the algorithm power of a human being, so I'll solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

Leet Code Table of Contents Starting from Zero

Last time Leet Code Day20 "134. Gas Station" starting from zero

Basically, I would like to solve the easy acceptance in descending order.

Twitter I'm doing it.

problem

448. Find All Numbers Disappeared in an Array

The difficulty level is easy. One of the Top 100 Liked Questions. The number of easy questions in the Top 100 Liked Questions has decreased considerably.

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

Find all the elements that are not visible in this given array.

Input: [4,3,2,7,8,2,3,1]

Output: [5,6]

Since the non-existent values between 1 and 8 are 5 and 6, those two are returned.

solution

The first implementation this time is to sort the array, compare the sorted array with the original array, and add it to the array that returns a non-existent value.

class Solution:
    def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
        num,ans = set(sorted(nums)),[]
        for i in range(1,len(nums)+1):
            if i not in num:
                ans.append(i)
        return ans
# Runtime: 464 ms, faster than 11.82% of Python3 online submissions for Find All Numbers Disappeared in an Array.
# Memory Usage: 23.7 MB, less than 7.14% of Python3 online submissions for Find All Numbers Disappeared in an Array.

However, it's not very fast, and it doesn't save that much memory consumption. So this time I tried to implement it elsewhere.

class Solution:
    def findDisappearedNumbers(self, nums: List[int]) -> List[int]:
        for num in nums:
            ans = abs(num) - 1
            if nums[ans] > 0:
                nums[ans] *= -1
        return [i+1 for i in range(len(nums)) if nums[i] > 0]
# Runtime: 380 ms, faster than 63.11% of Python3 online submissions for Find All Numbers Disappeared in an Array.
# Memory Usage: 21.5 MB, less than 17.86% of Python3 online submissions for Find All Numbers Disappeared in an Array.

It has improved a little. The latter gets ʻabs to get the absolute value, and if nums [ans] is greater than zero, substitutes nums [ans] for the value lacking -1 in nums [ans] . .. Finally, I wrote it by getting the length of nums in the comprehension notation, doing i + 1 if nums [i]> 0`, and finally returning.

Because of the simple processing, it is interesting to think that the amount of calculation etc. will change greatly with just one writing method.

If there is a good answer, I will add it.

Recommended Posts

Let Code Day21 Starting from Zero "448. Find All Numbers Disappeared in an Array"
Let Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
Let Code Day 66 "438. Find All Anagrams in a String" starting from scratch
Let Code Day 42 "2. Add Two Numbers" Starting from Zero
Let Code Day52 Starting from Zero "1351. Count Negative Numbers in a Sorted Matrix"
Let Code Day1 Starting from Zero "1389. Create Target Array in the Given Order"
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day2 Starting from Zero "1108. Defanging an IP Address"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day5 starting from zero "1266. Minimum Time Visiting All Points"
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day89 "62. Unique Paths" Starting from Zero
Let Code Day 55 "22. Generate Parentheses" Starting from Zero
Let Code Day18 starting from zero "53. Maximum Subarray"
Let Code Day 13 "338. Counting Bits" Starting from Zero
Let Code Day71 Starting from Zero "1496. Path Crossing"
Let Code Day 61 "7. Reverse Integer" starting from zero
Let Code Day 82 "392. Is Subsequence" Starting from Zero
Let Code Day51 Starting from Zero "647. Palindromic Substrings"
Let Code Day 50 "739. Daily Temperatures" Starting from Zero
Let Code Day 15 "283. Move Zeroes" starting from zero
Let Code Day14 starting from zero "136. Single Number"
Let Code Day59 starting from zero "1221. Split a String in Balanced Strings"
Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day57 Starting from Zero "35. Search Insert Position"
Let Code Day47 Starting from Zero "14. Longest Common Prefix"
Let Code Day78 Starting from Zero "206. Reverse Linked List"
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day24 Starting from Zero "21. Merge Two Sorted Lists"
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day75 starting from scratch "15.3 Sum"
Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day 29 "46. Permutations" starting from scratch
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
Let Code Day53 Starting from Zero "1365. How Many Numbers Are Smaller Than the Current Number"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day 80 "703. Kth Largest Element in a Stream" starting from scratch
Let Code Day 11 Starting from Zero "1315. Sum of Nodes with Even-Valued Grandparent"
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day 27 "101. Symmetric Tree" starting from scratch
Let Code Day 41 "394. Decode String" starting from scratch
Let Code Day 25 "70. Climbing Stairs" starting from scratch
Let Code Table of Contents Starting from Zero
Let Code Day69 starting from scratch "279. Perfect Squares"
Let Code Day 34 starting from scratch "118. Pascal's Triangle"
Let Code Day85 starting from scratch "6. ZigZag Conversion"
Let Code Day20 starting from scratch "134. Gas Station"
Let Code Day 88 "139. Word Break" starting from scratch
Let Code Day 28 "198. House Robber" starting from scratch
Let Code Day 39 "494. Target Sum" starting from scratch