Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted 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 Day47 starting from zero "14. Longest Common Prefix"

Right now, I'm prioritizing the Medium of the Top 100 Liked Questions. I solved all Easy, so if you are interested, please go to the table of contents.

Twitter I'm doing it.

problem

26. Remove Duplicates from Sorted Array The difficulty level is Easy.

The problem is given a sorted array. The problem is that it removes duplicate elements from the array, displays the element to write only once, and returns a new length.

Given nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

It doesn't matter what you leave beyond the returned length.

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.

solution

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        n = 0
        for i in range(1,len(nums)):
            if nums[n] < nums[i]:
                n += 1
                nums[n] = nums[i]
        return n+1
# Runtime: 84 ms, faster than 77.52% of Python3 online submissions for Remove Duplicates from Sorted Array.
# Memory Usage: 15.6 MB, less than 35.88% of Python3 online submissions for Remove Duplicates from Sorted Array.    

I wrote it by licking the elements from the beginning, comparing the index of each nums with the prepared n, and processing it. There is no need to twist it, and it can be said that it is an orthodox process.

I think this problem is a good problem for learning how to use arrays, for statements, and if statements, so even beginners who are interested can easily solve it, so I think it's easy to recommend.

Up to here for this time. Thank you for your hard work.

Recommended Posts

Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day 62 "83. Remove Duplicates from Sorted List"
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 Day24 Starting from Zero "21. Merge Two Sorted Lists"
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 Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
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 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 Day1 Starting from Zero "1389. Create Target Array in the Given Order"
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day75 starting from scratch "15.3 Sum"
Let Code Day 29 "46. Permutations" starting from scratch
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
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 Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
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
Let Code Day 36 "155. Min Stack" starting from scratch
Let Code Day 17 "169. Majority Element" starting from scratch
Let Code Day 33 "1. Two Sum" starting from scratch
I tried LeetCode every day 26. Remove Duplicates from Sorted Array (Python, Go)
Let Code Day59 starting from zero "1221. Split a String in Balanced Strings"
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 23 "226. Invert Binary Tree" starting from scratch
Let Code Day 22 starting from scratch "141. Linked List Cycle"
Let Code Day 30 starting from scratch "234. Palindrome Linked List"