Programmer Think

1, Title Description To define the data structure of the stack, please implement a min function that can get the smallest element of the stack in this type. In this stack, the time complexity of calling min, push and pop is all. O ( 1 ...

1, Linear table Linear table: when data is stored, it is stored continuously according to logic and forms a linear structure (feature: all have the concept of index, and the elements with smaller index must be logically arranged before the elements with larger index) Linear list subset: sequential list, linked list, stack, queue, string ...

1. Prefix, infix, suffix expression 1.1 prefix expression (Polish expression) Prefix expression is also called polish. The operator of prefix expression is before the operand, Examples: (3 + 4) × The prefix expression corresponding to 5-6 is [- x+3456] Computer evaluation of prefix expressions Scan the expression from right to ...

All the code in this article is written in C + + 4 double linked list, circular linked list and static linked list 4.1 double linked list 4.1.1 definition of double linked list In the previous knowledge, we once said that because each data element in the single linked list is divided into two parts - data field and pointer field, the ...

Day 34 540 a single element in an ordered array Give you an ordered array of integers, where each element will appear twice and only one number will appear once. Please find and return the number that appears only once. The solution you design must meet O(log n) time complexity and O(1) space complexity. method Since all elements in the a ...

Map interface description (double column set) JavaApi gives a partial overview of the Map interface An object that maps keys to values. A mapping cannot contain duplicate keys; Each key can be mapped to at most one value. The Map interface provides three collection views that allow you to view the contents of a Map in the form of key ...

subject Give you the head node of the linked list. Please arrange it in ascending order and return the sorted linked list. Example 1: Input: head = [4,2,1,3] Output: [1,2,3,4] Example 2: Input: head = [-1,5,3,4,0] Output: [- 1,0,3,4,5] Example 3: Input: head = [] Output: [] Tips: The number of nodes in the linked list is in th ...

What is bubble sorting Bubble Sort is the most basic exchange sort. Everyone must have drunk soda. There are often many small bubbles floating on it. This is because the carbon dioxide that makes up small bubbles is lighter than water, so small bubbles can float upward bit by bit. The basic idea of Bubble Sorting is to compare the values of ...

Tree structure: tree structure is a data structure that describes nonlinear hierarchical relationships. A tree is a set of n data nodes, which contains a root node. Under the root node, there are some non intersecting subsets, which are subtrees of the root node. Basic characteristics of tree structure: (1) In a tree structure, there is only ...

Template Title Link BST Lookup- Leetcode 270. Closest BST ValueBST Insert- Leetcode 701. Insert Node in BSTBST Delete- Leetcode 450. Delete Node in BST Binary Search Tree-BST Overview BST is a kind of binary tree, which has the structural properties of binary tree: there is only one Root node, each node can have at most two left and right sub ...