Programming VIP

C language review I've been learning data structure recently. Let's review the c language first (1) Data 1. Constants and variables 2. Data type (2) Operator Operator prioritization: ! Non > arithmetic operator > relational operator > & & and, | or > assignment operator (3) Statement 1. Assignment statemen ...

Sorted algorithm template collection: ACM template Click me to see the algorithm family bucket series!!! It is actually a new refining template integration plan Educational Codeforces Round 114 (Rated for Div. 2) Competition link: https://codeforces.com/contest/1574/ The first four questions are too simple () The last two question ...

Redis five data types Redis key basic command set key name -- Set a basic key value pair keys * -- View all keys exists key -- View the corresponding key Does it exist move key Number of corresponding database -- Put this key Move the corresponding data to another database expire key Expiration time(Unit second) -- Set how long this d ...

  Today is September 21, 2021. First of all, I wish you a Happy Mid Autumn Festival! May we all be blessed with longevity. Though far apart, we are still able to share the beauty of the moon together.. It's another full moon. I wish you all a reunion with the people you love and the people who love you on the Mid Autumn Festival~ Let's mo ...

Written earlier, this article is some questions about stack and queue asked by the interviewer during my interview. The answer to the question is summarized by myself. There may be some deviations. Please correct it If there are more problems in the follow-up, we will continue to add 1. What linear tables do you know? What about nonlinear ...

Drawing out: we learned linear tables and trees earlier. The linear table is limited to the relationship between a direct precursor and a direct successor; The tree can only have one direct precursor, that is, the parent node. However, when we need to represent many to many relationships, we need to use the data structure of graph. There are ...

Let's start with an example const { log } = console; var name = 'lsh'; log(num1); // undefined foo(); // Hello function foo() { var m = 10; log('Hello'); }; var num1 = 10; Similarly, they are executed first and then declared. Why can foo print out when num1 is undefined. 1, First, to execute the global code, a global object is cre ...

Sequence table partial pseudo code 2. Delete the element with the minimum value from the sequence table (assuming unique) and return the deleted element by the function. The empty position is filled by the last element. If the sequence table is empty, an error message will be displayed and the operation will exit. Writing thought: typedef st ...

11.3 shortest circuit problem In Chapter 9, we introduce the shortest path and longest path problem on weighted DAG and weighted DAG. Here we add rings to the graph. 11.3.1 Dijkstra algorithm Dijkstra algorithm is applicable to the case where the edge weight is positive. It can be used to calculate the single source shortest path on the po ...

Topic review 9 (9.10): mathematics related 1 maximum common divisor and minimum common multiple Code of maximum common divisor: int gcd(int a, int b){ if(b == 0) return a; else return gcd(b, a%b); } lcm(a,b) = a / gcd(a,b) * b; //Least common multiple 2 representation of scores Extra attention should be paid to division. If t ...