Programming VIP

First of all, I'd like to share my personal experience. I'm a graduate of 2021. I'm an ordinary undergraduate. I'm a non computer major. After being beaten by spring moves, I've successfully landed in a large factory and joined the post. It is necessary for Internet companies to have a recruitment algorithm. If the basic algorithm fails to p ...

Today, continue the recursive routine of binary tree.1, Lowest common ancestorGiven the head node of a binary tree and the other two nodes a and b, return the lowest common ancestor of a and b.Definition of lowest common ancestor: A and b look up and find the first same ancestor (this common ancestor may also be a or b itself)1. Recursive routi ...

This note is based on Small mound teaching video The notes are detailed and not boring. They are recommended to students who want to learn target detection. The following personal notes are for your reference. If there are errors, please correct them! Target detection: location + Category Face detection: face target Text detection: text ta ...

Ten classical sorting algorithms and their optimization Algorithm overview 0.1 algorithm classification Ten common sorting algorithms can be divided into two categories: Nonlinear time comparison sort: The relative order between elements is determined by comparison. Because its time complexity can not exceed O(nlogn), it is called nonline ...

catalogue Tree traversal Question 1: how to add one to all node values of a binary tree? Question 2: how does Leetcode 100 judge whether two binary trees are the same? Question 3: judge whether a tree is a sort binary tree Question 4: serialize and deserialize a binary tree dynamic programming Example: Fibonacci sequence Question 1: how ...

Solving the maximum common divisor In the foundation of C language, one of the most common problems is to solve the maximum common divisor. First of all, we need to know what the maximum common divisor is (those who have studied in primary school should understand it). I won't go into details here. Secondly, we need to use the most basic code ...

c + + anonymous school has opened many courses according to c + + programming. It was a sunny day. The breeze caresses the earth, across the river bank and plays among the willows. Xiaohang left the dormitory and walked to the "algorithm classroom" in the spring shower. The algorithm class is taught by XC teacher. "Ding - Ding ...

CS101 2021Fall PA3,4 problem solution PA3 The title description of PA3 is really the most unspeakable of the four Pa. at the beginning, both Title 1 and Title 2 are conditionally missing. In particular, the description of Title 2 is very unclear, there is no example explanation, and there is no accurate and rigorous definition of what scheme ...

Floating range of stock price Time limit: up to 30 use cases, 1 second (C/C + +), 1.5 seconds (Java) / memory limit: 256 MB (Stack 1 MB) It is assumed that the stock price of a company over an N-day period will be provided. You occasionally use the past stock price for simulation investment, but the violent fluctuation of stock price will make ...

This article continues to talk about the recursive routine of binary trees.1, Determine whether the binary tree is a search binary treeSearch binary tree definition: for any subtree with X as the head in a binary tree, the left subtree is smaller than X and the right subtree is larger than x. (the classic search binary tree has no duplicate val ...