Let Code Day1 Starting from Zero "1389. Create Target Array in the Given Order"

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

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

problem

1389. Create Target Array in the Given Order

The problem is -The returned array is initially empty. -Given nums [i] and index [i], insert nums in place of index. -Repeat until there are no more nums and index elements. Finally, it returns an array and ends.

If you can't imagine it, please read it.

class Solution:
    def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
        target = []
        for i in range(len(nums)):
            target.insert(index[i],nums[i])
        return target

# Runtime: 36 ms, faster than 36.25% of Python3 online submissions for Create Target Array in the Given Order.
# Memory Usage: 13.9 MB, less than 100.00% of Python3 online submissions for Create Target Array in the Given Order.

This is what I came up with. Since it was written in Constraints that the number of elements of nums and index is the same, then it is good to turn it once with a for statement and put the number of elements in the insert function respectively. However, it's not fast and I feel it's too mundane.

Another idea I came up with was to write in a while statement, According to What I did when I wanted to make Python faster, the while statement seems to be slower in Python.

In addition, I wrote it just in case and executed it.

class Solution:
    def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
        target = [0]*len(index)
        j = 0
        while j < len(index):
            target.insert(index[j], nums[j])
            j += 1
        return target[:len(nums)]

# Runtime: 36 ms, faster than 36.25% of Python3 online submissions for Create Target Array in the Given Order.
# Memory Usage: 13.8 MB, less than 100.00% of Python3 online submissions for Create Target Array in the Given Order.

...that? Same thing. Rather, it uses a little less memory.

Well, for the time being, this wasn't going to speed up significantly.

The ones I couldn't think of were those that used the zip function and those that used slices.

The zip function is as described in the Official Documentation.

Create an iterator that collects elements from each iterator. This function returns an iterator of a tuple, whose i-th tuple contains the i-th element of each argument sequence or iterable. This iterator will stop when the shortest of the input iterators is exhausted. Given a single iterable argument, returns an iterator consisting of a one-element tuple. With no arguments, it returns an empty iterator.

So,

hoge = [1,2,3,4,5]
foo = [6,7,8,9,10]
bar = zip(hoge,foo)
list(bar)
[(1,6),(2,7),(3,8),(4,9),(5,10)]

It works as above.

In addition, as the one using this, here.

class Solution:
    def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
        res = []
        for i, v in zip(index, nums):
            res.insert(i, v)
        return res
# Runtime: 28 ms, faster than 90.08% of Python3 online submissions for Create Target Array in the Given Order.
# Memory Usage: 13.8 MB, less than 100.00% of Python3 online submissions for Create Target Array in the Given Order.

fast! After this, if you have similar problems, it's better to use the zip function.

Thank you for your hard work, and I hope you can solve it and write an article.

~~ Let's use my spare time to write an article about the speed of Python for statements and while statements ... ~~

Recommended Posts

Let Code Day1 Starting from Zero "1389. Create Target Array in the Given Order"
Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
Let Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
Let Code Day21 Starting from Zero "448. Find All Numbers Disappeared in an Array"
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day 79 "1282. Group the People Given the Group Size They Belong To" Starting from Zero
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day16 Starting from Zero "344. Reverse String"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
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 39 "494. Target Sum" starting from scratch
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
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 Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day 42 "2. Add Two Numbers" Starting from Zero
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 Day52 Starting from Zero "1351. Count Negative Numbers in a Sorted Matrix"
Let Code Day73 Starting from Zero "1491. Average Salary Excluding the Minimum and Maximum Salary"
Let Code Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
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 Day2 Starting from Zero "1108. Defanging an IP Address"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
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 Day5 starting from zero "1266. Minimum Time Visiting All Points"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day 80 "703. Kth Largest Element in a Stream" starting from scratch
Let Code Day 66 "438. Find All Anagrams in a String" 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