Programming VIP

abnormal 1. What is an exception An exception is a signal of a program error. Once an error occurs in the program, an exception will be generated. If it is not handled in the program, the exception will be thrown, and the operation of the program will be terminated. In Python, the exceptions triggered by errors are as follows There are t ...

leetcode DFS+BFS+DSU question brushing summary 2 1-symmetric binary tree Title Link: Link here!!! Idea 1: iterative method For a binary tree, the left and right subtrees enter the queue respectively. If the left and right subtrees are empty, the traversal ends. If only one of the left and right subtrees is empty, or the root nodes of the left ...

1706. Where does the ball meet Problem solution Title Source: 1706. Where does the ball meet 2022.02.24 one question per day Daily question column address: LeetCode daily problem solution is being updated ❤️💕 Today's topic is easier. After solving the problem, I'll pack my bags and go back to school tomorrow. I hope it's easy tomorrow, heh ...

Title address: https://www.acwing.com/problem/content/2190/ Given a containing n n n points m m For a digraph with m edges, each edge has a lower bound and an upper bound. Find a feasi ...

Tip: This article has 6000 words, rough reading takes about 5 minutes and intensive reading takes about 30 minutes viewpoint This year's provincial tournament is a little different from the past. It pays more attention to mathematics, algorithms and ideas, and is a little closer to ACM. I believe this is a trend, and the future Blue Bri ...

Deep search Deep search DFS. When a new node is found, it will immediately traverse the new node. It needs to use stack implementation or recursive implementation equivalent to stack. If the parent node of the traversal loop has a different record, it can also be used to detect each parent node. Sometimes we may need to mark the nodes ...

background Recently, I brushed this interesting topic on LeetCode and thought of my love for Sudoku in junior high school. I couldn't help feeling very much. It turns out that this program can produce results in less than 1m, which made me waste so much time to study before. effect It is said that this is the most difficult Sudoku topic [cli ...

Guide to series of articles Guide to series of articles Open source project All articles in this series will be included in GitHub for unified collection and management. Welcome ISSUE and Star. GitHub portal: Kiner algorithm preface After understanding the core concept of search algorithm, knowing what problem solving tree is, and masteri ...

Link: https://ac.nowcoder.com/acm/problem/16577 Source: niuke.com Title Description There is a messenger who wants to travel around countries. Every time he goes to a country, he can learn a culture, but he is unwilling to learn any culture more than once (that is, if he learns a culture, he can't reach other countries with this culture). Diff ...

A. median Title: Given the array a1,a2,..., an with length n, do exactly k operations. Each operation selects two different positive integers i,j so that ai=ai+aj, and deletes aj from the array. What is the minimum median of the sequence after k operations? Median: a sequence with a length of M. its median is the number of floor ⌊ 2m+1 ...