Let Code Day 13 "338. Counting Bits" Starting from Zero

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 Day12 starting from zero "617. Merge Two Binary Trees"

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

problem

338. Counting Bits

The difficulty level is Medium. Recently, it seems that there are many good questions because I preferentially select from Top 100 Liked Questions. Of course, it is advantageous to have mathematical knowledge, but it is very interesting because there are many problems that will lead to the correct answer if you think carefully even if you do not have it.

A natural number num is given. Calculates the number of 1s in the binary representation of all numbers i in the range 0 ≤ i ≤ num and returns them as an array.

Do you think that this problem is only a problem statement? It will be. Let's look at an example.

Example 1:

Input: 2 Output: [0,1,1]

In this case, 2 is given as num. Converting [0,1,2] to a binary number yields [0,1,10], counting the number of 1s contained in each of these values gives 011, and converting to an array gives [0,1,10]. It becomes 1]. Finally returns this array.

Example 2:

Input: 5 Output: [0,1,1,2,1,2]

In this case, 5 is given as num. Converting [0,1,2,3,4,5] to a binary number gives [0,1,10,11,100,101], and counting the number of 1s contained in these values gives 011212, [0, 1,1,2,1,2].

solution

First, prepare a list to return, ʻans`, and consider using a for statement that repeats values from 1 to num + 1.

It does a binary conversion for each number, adds a count of 1 to the list, and finally returns the first prepared ʻans`. Perhaps the most important of these problems is an algorithm that also performs binary conversion and counts the number of 1.

Divide the i-th of ʻansby 2, and add the value to the remainder when i is divided by 2, and it will be converted well. This is because if the value ofnum` is odd, the last digit will be 1, and 1 will be deleted by right-shifting. If it is even, it will always be 0, so even if right-shifting, the same value will be obtained. This is because it becomes one of.

Considering this example, for example, if num is 4,

ans[4/2]+(4%2)

It will be. In this case, it is the second of ʻans [0,1,1,2] `, that is, 1. The 1 and 0, which is the remainder of (4% 2), are added, and 1 which is the number of 1s of '100' when 4 is converted to binary is added to the list.

I wrote as follows.

class Solution:
    def countBits(self, num: int) -> List[int]:
        ans = [0]
        for i in range(1,num+1):
            ans.append(ans[i//2] + (i%2))
        return ans
# Runtime: 84 ms, faster than 72.90% of Python3 online submissions for Counting Bits.
# Memory Usage: 20.7 MB, less than 5.00% of Python3 online submissions for Counting Bits.

I've been thinking about this problem for a long time. I want to come up with a solution more quickly.

Recommended Posts

Let Code Day 13 "338. Counting Bits" Starting from Zero
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 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 Day75 starting from scratch "15.3 Sum"
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 Day 29 "46. Permutations" starting from scratch
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 Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
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
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
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 Day8 starting from scratch "1302. Deepest Leaves Sum"
Let Code Day 22 starting from scratch "141. Linked List Cycle"