Programmer Think

This topic aims to share some interesting or valuable topics found in the process of brushing Leecode. [answer based on js, of course].Recursive algorithm has always been one of the key types of leetcode medium difficulty exercises, so the key is self-evident.Topic relatedOriginal address: https://leetcode-cn.com/problems/dui-cheng-de-er-cha-sh ...

Today, continue the recursive routine of binary tree.1, Determine whether it is a full binary treeFull binary tree definition: for a binary tree with height h, the number of nodes is (2^h - 1)1. Recursive routine ideaAccording to the definition of full binary tree, we only need to obtain the height and the number of nodes each time.That is, we ...

catalogue 1, Title Description English description Chinese description 2, Problem solving ideas 3, AC code C++ Java 4, Problem solving process First Bo   1, Title Description English description Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from posi ...

We are already familiar with the basic routine of binary tree. Next, let's talk about the recursive routine of binary tree, which can solve most binary tree problems in the interview, especially the tree dp problem. Its essence is to use the convenience of recursion to traverse binary tree.Judge whether the binary tree is a complete binary tree ...

Title Description Enter the root node root and an integer expectNumber of a binary tree to find all paths where the sum of node values in the binary tree is expectNumber. 1. The problem path is defined as the node from the root node of the tree to the leaf node (cat bin roars and prompts: pay great attention here - you must go to the leaf no ...

Python learning log Home page of RBHGO Welcome to pay attention Warm tip: creation is not easy. If reprinted, indicate the source. Thank you for your cooperation~ catalogue preface Last time we shared functions, we also talked about the data types commonly used in Python. These types of variables can be used as parameters or retu ...

reference resources Boss blog 1. Understanding of recursion Recursion is to call our own process. We don't have to worry about what each level does. We just need to pay attention to the implementation of a certain level, because each level is the same!!! Recursion can be seen as a simplified version of a loop, and the essence of recursion ca ...

1. Title Give you the root node root of the binary tree and an integer targetSum representing the target sum. Judge whether there is a path from the root node to the leaf node in the tree. The sum of all node values on this path is equal to the target and targetSum. A leaf node is a node that has no children. Example 1: Input: root = ...

Directions for the first three phases: Phase I Phase II Phase III This should be the last issue of backtracking. The previous topics are more conventional, basically what subset or arrangement of written language. This issue summarizes some topics that prefer application. Of course, the essence is still that set. Examples Letter combinati ...

Split palindrome string Title Description: give you a string s. please divide s into some substrings so that each substring is a palindrome string. Returns s all possible segmentation schemes. A palindrome string is a string that reads the same forward and reverse. See LeetCode's official website for an example. Source: LeetCode Link: https:// ...