Let Code Day 44 "543. Diameter of Binary Tree" 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 Day 43 "5. Longest Palindromic Substring" starting from zero

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

Twitter I'm doing it.

problem

543. Diameter of Binary Tree

The difficulty level is easy. Excerpt from Top 100 Liked Questions.

I found that I had solved it but forgot to write an article, so I will write it!

The problem is given a binary tree. It looks at the diameter of the tree and designs an algorithm that returns the length of the longest path of the node between the two points.

          1
         / \
        2   3
       / \     
      4   5   

Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

In this case, 3 is returned.

Commentary

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def diameterOfBinaryTree(self, root: TreeNode) -> int:
        self.ans = 0
        
        def dfs(node):
            if not node:
                return 0
            right = dfs(node.right)
            left = dfs(node.left)
            self.ans = max(self.ans,left+right)
            return max(left,right) + 1
    
        dfs(root)
        return self.ans
# Runtime: 40 ms, faster than 89.86% of Python3 online submissions for Diameter of Binary Tree.
# Memory Usage: 16 MB, less than 34.48% of Python3 online submissions for Diameter of Binary Tree.

Depth-first search measures the depth, and since it is a diameter, it will eventually pass through the parent, so you can solve it by adding +1.

If you can understand the structure of the tree, you can implement it relatively easily.

~~ It can't be said that it was sober ... ~~

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

Recommended Posts

Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day 23 "226. Invert Binary Tree" starting from scratch
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day 26 starting from scratch "94. Binary Tree Inorder Traversal"
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day 37 Starting from Zero "105. Construct Binary Tree from Preorder and Inorder Traversal"
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day 27 "101. Symmetric Tree" starting from scratch
Let Code Day16 Starting from Zero "344. Reverse String"
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 Table of Contents Starting from Zero
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 Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day14 starting from zero "136. Single Number"
Let Code Day 9 "701. Insert into a Binary Search Tree" 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 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 Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
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 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 Day 38 starting from scratch "208. Implement Trie (Prefix Tree)"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day4 starting from scratch "938. Range Sum of BST"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day75 starting from scratch "15.3 Sum"
Let Code Day 29 "46. Permutations" starting from scratch
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
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 Day5 starting from zero "1266. Minimum Time Visiting All Points"
Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day 41 "394. Decode String" starting from scratch
Let Code Day 25 "70. Climbing Stairs" starting from scratch
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"