Programmer Think

1, Double linked list There is only one pointer to its successor in the single linked list node, so that the single linked list can only traverse backward from the first node in turn. To access the predecessor node of a node (during insertion and deletion operations), you can only traverse from the beginning. The time complexity of access ...

Preface The principle of the Huffman tree and its python implementation: Q's knowledge blind spot in the recent interview, only remember the noun does not know its meaning. After three years of work, what you learned during the entrance examination for postgraduate studies is basically returned to the teacher. In addition to the list wor ...

Note: Title: You are playing balls and cows with your friends. The rules of the game are as follows: You write a secret number and ask your friend to guess what the number is. Every time a friend guesses, you will give him a hint to tell him how many digits in the guessed number belong to the number and the exact position are guessed correctl ...

A - chessboard problem https://vjudge.ppsucxtt.cn/contest/65959#problem/A Idea: whether dfs searches for different rows and columns, the main steps are the marking and release order of vis array. #include <iostream> #include <stdio.h> #define MAX 0x3f3f3f3f using namespace std; typedef long long ll; const int maxn = 10; int n, k, ...

Return to directory basic thought Select the minimum value from arr[0]~arr[n-1] for the first time, Exchange with arr[0], select the minimum value from arr[1]~arr[n-1] for the second time, exchange with arr[1], select the minimum value from arr[2]~arr[n-1] for the third time, and exchange with arr[2] Exchange,..., select the minimum value ...

preface: The blogger has opened a new column "data structure and algorithm". I hope you guys can give more support. Thank you very much! The blogger is currently in the initial stage of data structure. If there are any mistakes in the blog, I hope you guys will give us your advice. Thank you very much! Just like everything ...

The abstract data type of linear table is defined in the sequential table storage structure and implemented by C + + class. Its template mechanism is as follows. const int MaxSize = 100; template <typename DataType> class SeqList { public: SeqList( ); //Create an empty sequence table SeqList(DataType a[ ], int ...

We have learned the sequence table before. The sequence table refers to the arrangement one by one in the physical memory, and the addresses of each element in the sequence table are closely connected. This kind of table deletion and insertion is very troublesome because we have to move all elements back. The worst time complexity is O(n). When ...

Three storage representations of 1 string      String, i.e. string. It should be noted that there is no string data type in C language, but it is implemented as a data structure - "content limited linear table", and the concepts of empty string, blank string, string length, substring and main string are agreed [se ...

Introduction to pandas numpy can help us with numeric data, but that's not enough. Many times, our data includes not only numeric values, but also strings, time series, and so on. That's where we need pandas to help us with them. What is Pandas? The Pandas name comes from panel data Pandas is a powerful toolset for analyzing structured data, b ...