Sword finger - tree chapter (C + +)
Tree article
Question 1: depth of binary tree
Enter a binary tree and find the depth of the tree. The nodes (including root and leaf nodes) passing from root node to leaf node form a path of the tree. The length of the longest path is the depth of the tree, and the depth of the root node is regarded as 1.
Data range: the number of nodes ...
Posted by dlester on Sun, 23 Jan 2022 10:11:20 +0100
Sword finger offer (C + +) -- linked list collection
This series of notes is for self-study algorithm. It only records the problem solving code and some problem solving ideas. All topics are copyrighted by LeeCode and sword finger offer; We recommend a great series of blog for brushing questions and taking notes, which can be used as a reference for the classification of questions in this series: ...
Posted by vcarter on Sun, 23 Jan 2022 07:00:44 +0100
Codeforces Round #767 (Div. 2) (Updated)
title : Codeforces Round #767 (Div. 2) date : 2022-1-23 Tags: ACM, practice notes author : Linno
Title link: https://codeforces.com/contest/1629
Test progress: 4/7
A-Download More RAM
Give you the initial memory capacity k and n expansion packs. If your current memory is larger than the expansion pack's requirement ai, you can increase th ...
Posted by bidntrade on Sun, 23 Jan 2022 03:08:18 +0100
Introduction to C + + STL
Reference link
https://www.bilibili.com/video/BV1et411b73Z?p=185
STL acquaintance
Birth of STL
For a long time, the software industry has been hoping to build something that can be reusedThe object-oriented and generic programming idea of C + + aims to improve the reusabilityIn most cases, data structures and algorithms fail to have a set o ...
Posted by adriaan on Sun, 23 Jan 2022 02:21:47 +0100
Thoroughly understand Kruskal algorithm (with C + + code implementation)
I problem
The six vertices in the figure represent six villages respectively, and the weight of the line segment represents the distance between villages. How can I find the shortest way to visit each village, and each village can only be visited once.
II solve
1. Extract the edges of the graph, arrange the edges from small to large accord ...
Posted by Porl123 on Sat, 22 Jan 2022 22:09:12 +0100
Operating system experiment 2 - virtual memory / memory management
1, Experimental content
Simulate the hardware address translation and page missing interrupt in paging storage management, and select the page scheduling algorithm to deal with page missing interrupt.
2, Experimental purpose
In computer system, in order to improve the utilization of main memory, auxiliary memory (such as disk) is often u ...
Posted by phouchin on Sat, 22 Jan 2022 17:46:20 +0100
Syntax of template class for C + + basic learning
1. Concept of template
Templates are general molds, which can greatly improve the reusability, such as templates in life and templates for one inch photos: PPT template: It can also be concluded from the above that the characteristics of the template are:
The template can't be used directly. It's just a frameworkThe universality of template ...
Posted by rayden on Sat, 22 Jan 2022 15:18:39 +0100
libreoffice 01 windows version compilation
01 basic information
At present, libreoffice is the mainstream open source version of office. Its predecessor is openoffice. Official website: https://zh-cn.libreoffice.org/ wiki: https://wiki.documentfoundation.org/ Compilation instructions for windows version: https://wiki.documentfoundation.org/Development/BuildingOnWindows Release version ...
Posted by Lodar on Sat, 22 Jan 2022 14:48:28 +0100
Educational Codeforces Round 121 (Rated for Div. 2)A-C problem solution
Blog home page: https://blog.csdn.net/qq_50285142Welcome to praise ๐ Collection โญ ๏ผ attention โค Leaving a message. ๐ Please correct any errors ๐ Click to receive a large number of learning resources ๐
A. Equidistant Letters
A string that requires equal distances between the same letters and rearranges them
Find the same letters ...
Posted by mooshuligan on Sat, 22 Jan 2022 12:52:07 +0100
BUPT 2021 autumn calculation introduction eighth experiment
BUPT 2021 autumn calculation introduction eighth experiment
Recursive evaluation one
Experiment 6_ 1_ Recursive evaluation I (100 points) Existing function f(n), n is an integer greater than or equal to 0. f(n) = 0 when n is equal to 0, f(n)=f(n-1) +n when n is greater than 0 3
Note: this problem requires recursive solution, and global varia ...
Posted by NoReason on Sat, 22 Jan 2022 10:46:18 +0100