Programmer Group

Bubble sorting and its optimization Basic idea of bubble sorting 1. Access each element of the array from scratch and exchange between adjacent elements 2. Exchange elements in pairs. Change the small one to the front and the large one to the back. 3. After all elements are exchanged, one exchange is completed, and the largest element will ...

The title requires the k-largest element in the array. My most direct idea is to sort the whole array and then return the k-largest element in the array. 1. Bubble sorting To complete the sorting of the array nums, bubble sorting requires nums.size() - 1 round of sorting, because the last element does not need to be sorted. Bubble sort e ...

Title: Given a binary tree and one of its nodes, please find the next node in the middle order traversal order and return. Note that the nodes in the tree contain not only left and right child nodes, but also pointers to parent nodes. Problem solving ideas: Let's take the above figure as an example. The middle order traversal of the binary ...

The first is the representation of nodes in Python Similar to C language, C language is represented by structs, while Python is represented by classes 1. Use class to represent nodes class ListNode(object): def __init__(self,val,next = None): self.val = val #Data domain self.next = next ...

Circular linked list As long as the two ends of the linked list are connected, it becomes a circular linked list, which is usually called circular linked list It should be noted that although the circular linked list is a ring, it is still a linked list in essence. Therefore, in the circular linked list, you can still find the head pointe ...

Linked list Single linked list: a linked list refers to a linear structure connected in series through pointers. Each node consists of two parts, one is the data field, the other is the pointer field (storing pointers to the next node), and the pointer field of the last node points to null (null pointer). The entry node of the linked list ...

Sword finger Offer 59 - I. maximum value of sliding window Given an array num and the size k of the sliding window, please find the maximum value in all sliding windows. Example: input: nums = [1,3,-1,-3,5,3,6,7], and k = 3 output: [3,3,5,5,6,7] explain: Position of sliding window Maximum --------------- -- ...

Force button topic link (opens new window) Given a binary tree and a target sum, judge whether there is a path from root node to leaf node in the tree. The sum of all node values on this path is equal to the target sum. explain:   A leaf node is a node that has no children. Example:   Given the following binary tree, and the ...

Xiao Ming is typing a document using Microsoft Word. The document contains only a-z lowercase letters and spaces. During typing, the Home key, End key, _arrow key, _arrow key, Insert key, Backspace key may be pressed one or more times. Write a program that gives Xiao Ming the sequence of keys on the keyboard and outputs the final text displayed ...

Content: complete the addition operation of two polynomials. It is known that there are two polynomials PM (x) and QM (x). Design an algorithm to realize the operation of Pm(x)+Qm(x) and Pm(x)-Qm(x). Moreover, the wig operation does not reopen the storage space, and it is required to be realized by chain storage structure. Steps: algorithm an ...