Shulou(Shulou.com)06/01 Report--

Most people do not understand the knowledge points of this article "how to use the C language double-pointer algorithm", so the editor summarizes the following content, detailed content, clear steps, and has a certain reference value. I hope you can get something after reading this article, let's take a look at this "C language double-pointer algorithm how to use" article.

Double pointer

First of all, we need to know what a double pointer is. It sounds classy, but we just have hands.

Double pointer means that in the process of traversing an object, instead of using a single pointer to access, but using two pointers in the same direction (fast and slow pointer) or opposite direction (colliding pointer) to scan, so as to achieve the corresponding purpose.

In other words, the double pointer method makes full use of the ordered array, so when it comes to ordered arrays, we should give priority to double pointers to solve the problem, because traversing two pointers at the same time will reduce the space complexity and time complexity, so that the operation can be simplified in some cases.

Colliding pointer

Similar to the encounter problem, the collision pointer means that in an ordered array, the index pointing to the far left is defined as the left pointer, and the right pointer is defined as the right pointer, and then traversing the linked list from both sides, the process is visualized as collision, and it is customary to define the left and right pointers as left and right. We give a rough code logic:

Void hit (int* arr,int arrsize) {int* left = arr;int* right = arr + arrsize-1 position while (left)

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.