Programming VIP

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 ...

Catalogue of series articles leetcode: Week 1 preface . The blogger has just finished the study of RHCE. Next, he decides to brush the algorithm problem of leetcode, 2-3 times a day, and consolidate the review at the weekend. first day 1. Binary search Given an n-element ordered (ascending) integer array nums and a target value ...

Template meta programming example - how to design a general geometry Library design principle Suppose you need to use a c + + program to calculate the distance between two points You might do this: First define a struct: struct mypoint { double x, y; }; Then define a function containing the calculation algorithm: double distance(myp ...

Binary sort tree Requirements: for a sequence (7, 3, 10, 12, 5, 1, 9), it is required to query and add data efficiently Basic introduction: Binary sort tree: BST: (Binary Sort(Search) Tree). For any non leaf node of the binary sort tree, the value of the left child node is required to be smaller than that of the current node, and the valu ...

Title address Leetcode 746. Climb stairs with minimum cost Title Description Give you an integer array cost, where cost[i] is the cost of climbing up the ith step of the stairs. Once you pay this fee, you can choose to climb up one or two steps. You can choose to climb the stairs from the steps with subscript 0 or subscript 1. Please calc ...

Today, I'm going to take a simple note of mobilenet. I'm afraid I'll forget the relevant contents of mobilenet. First of all, we need to know that mobilenet is a model framework that can be used on embedded devices. Therefore, its biggest advantage is that it has less parameters, and we still need to ensure that the accuracy of computer vision ...

Description: Night Fury is a very rare and most dangerous and intelligent dragon from "master of dragon training 2". It is very different from other dragons in shape. It is similar to bats. At the same time, it combines the size of cats and the sharp eyes of wild wolves, with black scales on its body. The volume is petite, the expres ...

1 Introduction In order to ensure that the transformer is not overloaded when charging the electric vehicle in the community, an orderly charging control method of the electric vehicle in the community based on genetic algorithm is proposed On the basis of comprehensively considering the charging demand of users, aiming at not changing the pow ...

Convenient for self review == 1.01 Backpack Problem Description: there are n valuable items and a backpack with a volume of v. there is one for each item. Calculate the maximum value of the items that the backpack can hold. Analysis process: 1. Describe the state: we use f [i] [j] to indicate that only the first I items are selected, and th ...

    Sample input and output Examples input 6 2 4 6 5 3 4 6 4 9 1 2 1 2 3 1 3 4 2 3 5 4 5 6 output 16 Violent dfs is enough. We should think about the conditions we have: 1. Planting time of N seeds 2.M existing seeds 3.K hybrid scheme 4. Find the shortest time to plant T How do I get to dfs? First of all, the boundary ...