Programmer Think

1 linked list structure The sequence table has the following disadvantages: When inserting or deleting nodes, it is often necessary to move a large amount of dataIf the table is large, it is sometimes difficult to allocate enough memory space, which may lead to memory allocation failure and unable to store In order to overcome the shortcomin ...

For the implementation of parallel query set based on basic data type, please refer to QuickUnion. The underlying implementation of user-defined object and query set: linked list + Map mapping [the linked list here is represented as a tree] Logically: multiple trees from bottom to top. The array can no longer meet the requirements of user-de ...

Algorithm notes Chapter 1: basic algorithm 1-1 sorting Algorithm classification Ten common sorting algorithms can be divided into two categories: Comparison sort: the relative order between elements is determined by comparison. Because its time complexity cannot exceed O(nlogn), it is also called nonlinear time comparison sort.Non compa ...

You can also use my independent blog—— www.huliujia.com Get this article Array and linked list Array and linked list are two very basic data structures. Each search of linked list needs to traverse linearly from the beginning of the node, and the time complexity is O(n). The array can use binary search by maintaining the element ...

1, Overview We know that in HashMap, the location of a key value pair stored in the internal data of HashMap is related to the hashCode value of K, which is also because the hash algorithm of HashMap is based on the hashCode value. Three concepts should be distinguished here: hashCode value, hash value, hash method and array subscript hashCo ...

9.1 hash table (hash) - Google questions Let's take a look at the actual demand. A computer problem of google: In one company, when a new employee comes to report, it is required to add the employee's information (id, gender, age, address...). When entering the employee's id, it is required to check Find all the information of the empl ...

STL Hey, c + + long time no see, meet you again familiar and strange. The feeling of practicing many brush questions fades a little, and you need to be familiar with the actual questions again. This article will be continuously updated Today, let's remedy the concept of STL in time to facilitate more efficient problem brushing in the future. ...

1, vector container 1.vector introduction Vector container is a dynamic array provided in the form of class template. Similar to array, the elements of vector are also stored in continuous space, which supports subscript access to elements. Different from array, the size of vector container can be changed dynamically, and the storage spac ...

Ordinary segment treeProblem introductionGiven that a sequence has n (n < = 100000) elements, there are the following two basic operationsQuery: find the sum of all elements in a given interval [l..r]Modify: modify the value of an element.Task: output the value of each query.Task quantity m (m < = 100000), only the above two operations.Na ...

Arrays and linked lists Array features 1. Continuous: sequential storage. 2. Fixed length: once defined, the length cannot be changed. 3. According to the subscript, you can directly access the elements of this subscript. 4. It is not suitable for inserting, deleting and other operations. In python, the list is a dynamic array Linked li ...