Programmer Group

Author: Ming Xue Candleid: fuxuemingzhuPersonal blog: http://fuxuemingzhu.cn/Public number: snowy candlesKey words in this article: Leetcode, buckle, brush title, Python, C++, chain list, intermediate node, delete Title Address: https://leetcode-cn.com/problems/delete-the-middle-node-of-a-linked-list/ Title Description Give you the he ...

Problem A - Find the 3-bit even number meaning of the title Any three numbers in the array are spliced into three digits. Non even numbers and no leading 0 are required. All qualified numbers are returned in ascending order thinking See that the range of the given array is 100, and directly triple loop. Since the requirement is not repeated, i ...

To store multiple elements, array is the most commonly used data structure, but array also has many disadvantages: The creation of an array usually requires a continuous memory space, and the size is fixed. Therefore, when the current array cannot meet the capacity requirements, it needs to be expanded (usually apply for a larger array, an ...

Queue learning notes – chain team and sequence team 1. Queue (circular queue) In the sequential storage structure of the queue, in addition to using a group of storage units with continuous addresses to store the elements from the queue head to the queue tail in turn, it is also necessary to attach two integer variable front and rear to ...

Linked list 1. Preface C/C + + has its own data structure - array, which is easy to use, but it can't insert or delete elements at any position, so we need another data structure to realize this operation, so the linked list was born. The linked list supports insertion or deletion at any position, but can only access the elements in order. We ...

1. Numbers that occur only once Title Description: Given a non-empty integer array, each element occurs twice, except for one element that occurs only once. Find the element that only appears once. Example 1 Input: [2,2,1] Output: 1 Example 2: Input: [4,1,2,1,2] Output: 4 1. Ideas 1. The easiest way to think about it is to determine ...

Chapter 3 stack and queue Stacks and queues are linear tables that restrict inserts and deletions to the "end" (end) of the table That is, stacks and queues are subsets of linear tables (linear tables with restricted insertion and deletion positions) Stack features: first in, last out Queue characteristics: first in first out 3.1 ...

JavaScript data structure and algorithm (VII) bidirectional linked list One way linked list and two-way linked list Unidirectional linked list You can only traverse from beginning to end or from end to end (generally from beginning to end).The linked list connection process is one-way. The implementation principle is that there is a referenc ...

1, Foreword The sequential storage structure of linear table (such as array) has continuous storage space, so we don't have to worry about the logical relationship between elements. The biggest advantage of linear table is that it can quickly access the elements at any position in the table. The disadvantage of linear table sequential storage ...

021. Delete the penultimate node of the linked list Title: Given a linked list, delete the penultimate node of the linked list, and return the head node of the linked list. Example: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Idea: Fast and slow pointers: the slow pointer is the head node, the difference between the f ...