Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"

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.

Apparently, many engineers take measures on the site called LetCode.

It is a site that trains the algorithmic power that can withstand the coding test that is being done in the early story, and it is an inevitable path for those who want to build a career at an overseas tech company.

I wrote it in a big way, but I have no plans to have such an interview at the moment.

However, as an IT engineer, it would be better to have the same level of algorithm power as a person, so I would like to solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

I'm solving it with Python3.

Leet Code Table of Contents Starting from Zero

Last time Leet Code Day53 starting from zero "1365. How Many Numbers Are Smaller Than the Current Number"

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

1290. Convert Binary Number in a Linked List to Integer The difficulty level is Easy.

The problem is given a unidirectional linked list head. Each node has 0 or 1 as values and treats them as binary values. Here, convert those binary notation values to decimal and design an algorithm that returns numbers.

Input: head = [1,0,1] Output: 5 Explanation: (101) in base 2 = (5) in base 10

Input: head = [0] Output: 0

Input: head = [1] Output: 1

Input: head = [1,0,0,1,0,0,1,1,1,0,0,0,0,0,0] Output: 18880

Input: head = [0,0] Output: 0

solution

I feel that the base conversion is a bit of a story. It may be annoying at first, but if you take a closer look, it is often one pattern, so it is recommended to solve the problem and get used to it.

The important thing about this problem is

--Cover all the elements of the linked list --Convert from binary to decimal

So it may be easy if you can understand it.

It seems that it is enough to prepare an array, add it to the array, move to the next element, and write it with a while statement.

It's a base conversion, but in Python, for example, int('10',2) If you write it in the form of, it will convert the binary number to the decimal number, so if you use it, the conversion itself is easy.

For more information [Official Document] We recommend that you refer to (https://docs.python.org/ja/3/library/stdtypes.html?highlight=find).

Let's write the flow up to this point in Python.

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def getDecimalValue(self, head: ListNode) -> int:
        ans = []
        while head:
            ans.append(str(head.val))
            head = head.next
        return int(''.join(ans),2)
# Runtime: 16 ms, faster than 99.88% of Python3 online submissions for Convert Binary Number in a Linked List to Integer.
# Memory Usage: 13.7 MB, less than 85.59% of Python3 online submissions for Convert Binary Number in a Linked List to Integer.

join function is a convenient function that concatenates and returns as a character string if you specify the delimiter element.

For example, if you consider the example, when the while statement is finished, head = [1,0,1] is added to the array ʻans with str, so ʻans = ['. It becomes 1', '0', '1'] . If you write after return to concatenate here, it will be ʻans ['101', 2] `, so it will be finally converted to a decimal number and returned.

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

Recommended Posts

Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day78 Starting from Zero "206. Reverse Linked List"
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day 61 "7. Reverse Integer" 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 22 starting from scratch "141. Linked List Cycle"
Let Code Day 30 starting from scratch "234. Palindrome Linked List"
Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day52 Starting from Zero "1351. Count Negative Numbers in a Sorted Matrix"
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 Day12 Starting from Zero "617. Merge Two Binary Trees"
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 Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
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 Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day16 Starting from Zero "344. Reverse String"
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 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 Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
Let Code Day 9 "701. Insert into a Binary Search Tree" starting from scratch
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 23 "226. Invert Binary Tree" starting from scratch
Let Code Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day 42 "2. Add Two Numbers" Starting from Zero
Let Code Day1 Starting from Zero "1389. Create Target Array in the Given Order"
Let Code Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
Let Code Day21 Starting from Zero "448. Find All Numbers Disappeared in an Array"
Let Code Day57 Starting from Zero "35. Search Insert Position"
Let Code Day47 Starting from Zero "14. Longest Common Prefix"
Let Code Day 37 Starting from Zero "105. Construct Binary Tree from Preorder and Inorder Traversal"
Let Code Day68 starting from scratch "709. To Lower Case"
Let Code Day 19 Starting from Zero "121. Best Time to Buy and Sell Stock"
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
Let Code Day 79 "1282. Group the People Given the Group Size They Belong To" Starting from Zero
Let Code Day 26 starting from scratch "94. Binary Tree Inorder Traversal"
Let Code Day24 Starting from Zero "21. Merge Two Sorted Lists"
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 Day3 starting from scratch "1313. Decompress Run-Length Encoded List"
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 Day53 Starting from Zero "1365. How Many Numbers Are Smaller Than the Current Number"
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"