Programmer Group

1, Basic concept of graph   Graph - graph G is composed of two sets V(G) and E(G), marked as G=(V,E), where V(G) is a non empty finite set of vertices,   E(G) is a finite set of edges, and edges are disordered or ordered pairs of vertices. Graph cannot be empty 1. Terms and definitions of drawings 1) Directed graph If E is a finite s ...

  Zero, write in front          This series is not updated frequently. It's interesting to see today's topic. Let's have a look. The main knowledge points are [question 04] given a and b, ask whether a can be divided by b. The Application of if statement and conditional operatorhttps://blog.csdn.ne ...

Establishing Binary Tree Storage Structure--Binary Chain List The same binary tree can be built in different order, which corresponds to different codes and different user inputs. The process of building a binary tree in different order is different but the final result is the same, so the binary tree can be built by traversing in order, but t ...

28 implementation str () Determines whether a string is a substring of another string and returns its position. Enter a parent string and a substring, and output an integer indicating the position of the substring in the parent string. If it does not exist, return - 1. Input: haystack = "hello", need = "ll" Output: 2 ...

1. Bracket matching problem LeetCode link: [20. Valid brackets] This problem is a classic example of using stack to solve problems; The idea is as follows: Traverse the string. If it meets the inverted left parenthesis, it will be put on the stack. If it meets the inverted right parenthesis, it will take the element at the top of the stac ...

Click here to see the problem There is a tree with \ (n \) points. You need to perform \ (m \) coloring operations. Each operation gives two point pairs \ ((x_1,y_1) \) and \ ((x_2,y_2) \), and you need to select a point pair to color all the edges in the path on the corresponding tree. It is required that the same edge cannot be dyed repeated ...

Introduction to balanced tree Preface: because \ (fhq \) is better than \ (splay \) in all aspects, mainly due to the small code size, the topic of this solution is \ (fhq\) \(treap \), that is, non rotating \ (treap \). Template Template question Definition and nature Balanced tree is a data structure composed of binary search tree and heap, s ...

Binary search basis 1. Preface In the past, I always felt that I had to go through all the concepts before I could start to brush the questions. I didn't know that practice was the shortcut to master knowledge, rather than forgetting to recite it. To learn knowledge, we need to settle down and go step by step, otherwise we will be punished fo ...

[NEFU sharp data structure] operation related to experiment 8 sorting table Serious people who handwritten sort ah, brainless sort. If you are admitted to the computer sorting stage, sort will kill indiscriminately, but it's a pity that you can't arrange it. Recommended reading: [data structure] NEFU sophomore sharp experiment reference direct ...

Experiment 3 deadlock avoidance algorithm of process 1, Experimental purpose According to the idea of banker algorithm, write a program to solve the deadlock problem of concurrent processes. 2, Background knowledge This experiment requires the design and implementation of banker algorithm. Banker algorithm is a classic deadlock avoidance al ...