Luo Gu: P6687 on how to play with Excel tables [judgment questions (whether there is a solution) + finding the number of pairs in reverse order]

Valley: matrix rotation It can be found by observation that: For such a two column table, a 180 ° rotation of a 2x2 square is equivalent to the exchange of upper left and lower right, lower left and upper right And this exchange won't change anything? Two numbers in any column will not be changed! But it will change the positional rela ...

Added by littledragon on Thu, 06 Jan 2022 01:08:18 +0200

Data structure and algorithm ~ overview and queue

catalogue Importance of data structures and algorithms Relationship between data structure and algorithm Linear structure and nonlinear structure Sparse arrays and queues Sparse array queue Importance of data structures and algorithms Algorithms are the soul of programs. Excellent programs can still maintain high-speed computing whe ...

Added by chick3n on Wed, 05 Jan 2022 22:30:51 +0200

707. Design linked list (medium linked list)

707. Design linked list Design the implementation of linked list. You can choose to use single linked list or double linked list. A node in a single linked list should have two attributes: val and next. val is the value of the current node, and next is the pointer / reference to the next node. If you want to use a two-way linked list, you also ...

Added by MattSharp on Wed, 05 Jan 2022 21:55:12 +0200

Introduction to C language 130 questions - OJ

BC1 practice produces true knowledge #include <stdio.h> int main() { printf("Practice makes perfect!\n"); return 0; } BC2 I'm big V #include <stdio.h> int main() { printf("v v\n v v \n v \n"); return 0; } BC3 has capacity #include <stdio.h> int main() { printf("The size of short is %d b ...

Added by rharter on Wed, 05 Jan 2022 21:50:50 +0200

A sharp tool for fast weight removal under the background of large amount of data

1, Foreword When we use mainstream data structures such as Lists, Maps, Sets, Trees, etc., I can get the exact results, whether the data exists or not. Probabilistic data structure can provide a memory based method to quickly find a possible rather than exact result. This probabilistic data structure is the Bloom filter. The Bloom filter check ...

Added by LuiePL on Wed, 05 Jan 2022 21:44:15 +0200

PAT class B 1003 I want to pass

Topic information "Correct answer" is the most gratifying reply given by the automatic question judgment system. This question belongs to PAT's "correct answer" distribution - as long as the read string meets the following conditions, the system will output "correct answer", otherwise it will output "wrong an ...

Added by Jeremysr on Wed, 05 Jan 2022 20:16:40 +0200

Sequential storage structure of linear table and implementation of operation

Requirements: use the sequential storage structure definition of the linear table in the book: 1) Write the following functions: (1) initialize a linear table; (2) On the basis of initialization, create a linear table containing 15 positive integer values not greater than 100 (15 values are randomly generated by the computer); (3) Insert a num ...

Added by xudzh on Wed, 05 Jan 2022 18:49:36 +0200

[Leetcode data structure algorithm] merge two ordered arrays (sequential table)

Title Content: You are given two integer arrays nums1 and nums2 in non decreasing order, and two integers m and n representing the number of elements in nums1 and nums2 respectively. Please merge nums2 into nums1 so that the merged array is also arranged in non decreasing order. Note: the final merged array should not be returned by the fun ...

Added by clarket on Wed, 05 Jan 2022 17:38:06 +0200

Algorithm implementation of Huffman tree and Huffman coding

Algorithm implementation of Huffman tree and Huffman coding (required, confirmatory experiment) Experimental purpose Be familiar with the construction method of Huffman tree and the application of Huffman coding, and understand the application process of Huffman tree in the field of communication and coding. Experimental content (1) Input a ...

Added by gt500pwr on Wed, 05 Jan 2022 16:56:58 +0200

Detailed traversal of graph (breadth first and depth first)

The algorithm practice of data structure is for homework. I chose the traversal of the graph, because I feel that it will be more clear about the relevant algorithms than other topics. This article is written to make everyone more clear about the traversal algorithm of the graph, and also to review their relevant knowledge again, so as to help ...

Added by yeshuawatso on Wed, 05 Jan 2022 06:22:43 +0200