Programming VIP

Minimum depth of binary tree Title: Minimum depth of binary tree "Programmer code interview guide" question 33 P100 difficulty: original question ★☆☆☆ advanced question ★★★★ There are ordinary solutions and advanced solutions in this problem book. The advanced solution uses the divine method of traversing the binary tree - Morris trav ...

438. Find all letter words in the string Meaning: Given two strings S and p, find the substrings of all ectopic words of p in s, and return the starting indexes of these substrings. The order in which answers are output is not considered. Ectopic words refer to strings with the same letters but arranged differently. Example 1: input: ...

Title Source: Blue Bridge Cup-2017 Xiao Ming eats breakfast at a bun shop almost every morning. This bun is paved with N kinds of steaming cages, of which the second type just fits Ai buns Each type of steamer has many cages, which can be considered infinite. Whenever a customer wants to buy X buns, the uncle sells buns and chooses sever ...

Add two numbers Give you two non empty linked lists to represent two non negative integers. They store each number in reverse order, and each node can store only one number. Please add the two numbers and return a linked list representing sum in the same form. You can assume that neither number starts with 0 except the number 0. Example 1: Inp ...

Title Description You are given two integer arrays nums1 and nums2 in non decreasing order, and two integers m and n representing the number of elements in nums1 and nums2 respectively. Please merge nums2 into nums1 so that the merged array is also arranged in non decreasing order. Title Example Example 1: Input: nums1 = [1,2,3,0,0,0], ...

dynamic chain Single linked list: //Head node refers to the first node in the linked list, which can be divided into real head node and virtual head node; (1) Real head node: the first node is used to store data (usually the real head node is used). (2) Virtual head node: the first node cannot store data. (3) Header pointer: it is just a ref ...

sort() function: it is a sort function in c++ stl library. Learning to use this function can greatly save us from writing a sort function, such as bubble sort (O(n2)). Moreover, this sort function is written by quick sort, so the time complexity is O(nlogn), so it can also greatly reduce the program running time. Note that the sorting range is ...

Linear table Definition and characteristics of linear table A linear table is a finite sequence of data elements with the same characteristics. Linear list: an ordered sequence composed of n (n > = 0) data elements (nodes) a1,a1,... An. definition: 1. The number n of data elements is defined as the length of the table. 2. When n=0, it ...

▲ in graph theory, there are two ways of traversing trees: breadth first traversal and depth first traversal Breadth first traversal (BFS): starting from an un traversed node of the graph, traverse the adjacent nodes of the node first, and then traverse the adjacent nodes of each adjacent node in turn (i.e. traversal layer by layer) For example ...

The so-called Brute force is to list all possible situations, and then check them one by one to find the answer. This method is simple, direct, does not play tricks, and makes use of the powerful computing power of the computer. Violence laws are often synonymous with "inefficiency". However, compared with other "efficient&quot ...