Programming VIP

introduction: Sorting algorithm is one of the most basic algorithms in data structure and algorithm. Here are ten classic sorting algorithms to explain. Taoist friends who don't know can come here to sweep away their blindness. From "rookie tutorial". explain    sorting algorithms can be divided into internal sorting ...

🧭 Implementation class of Map interface HashMap 🚀HashMap HashMap is an implementation class of Map interface, which is displayed in blog Java Map interface We have used HashMap to summarize the commonly used methods. HashMap is the most frequently used implementation class of Map interface.HashMap stores data in the form of key value ...

overview LeetCode Hot: realize Trie (prefix tree), the K largest element in the array, the largest square, flip binary tree, palindrome linked list, the nearest common ancestor of binary tree, the product of arrays other than itself, the maximum value of sliding window, search two-dimensional matrix II and complete square number LeetCode ...

How to understand "heap" Heap sorting is an in-situ sorting algorithm with time complexity of O(nlogn) There are two characteristics of the heap: A complete binary treeEach node in the heap must be greater than or equal to (or less than or equal to) the value of its left and right child nodes; The heap whose value of each node is g ...

hash address The hash address is a logical address, not an actual address. The hash address is obtained through the hash function hash function The hash function is determined by yourself. You can choose any function. Suppose you use the array to store the hash data, use the subscript to describe the position in the array, and cons ...

Binary tree is a common data structure in our daily learning. During the interview and study, we will inevitably encounter some algorithm problems related to binary tree. Today, I brought you some classic binary tree basic algorithm problems. Let's have a look! catalogue 1. Check whether the two trees are the same ① Title Description ② tr ...

Eight methods of List collection object de duplication and attribute de duplication - Fage talk Java - blog Garden 1, Outline of this paper In this article, I want to write about eight methods of de duplication of List set elements. In fact, through flexible application, arrangement and combination, there are not necessarily eight, but there ...

1, Title Requirements Give you the root node of a binary tree, root, and judge whether it is an effective binary search tree.A valid binary search tree is defined as follows: The left subtree of a node contains only the number less than the current node. The right subtree of a node only contains a number greater than the current node. ...

1. String ①. Definition of string String -- a finite sequence composed of zero or more characters. It is a special linear table. Its data element is one character, that is, a linear table with limited content. Substring: A subsequence of any consecutive characters in a string Main string: String containing substring Character pos ...

Definitions and basic terms of drawings   Figure: G=(V, E)    Grapg = (Vertex, Edge)    V: finite non empty set of vertices (data elements);   E: finite set of edges Undirected graph: each edge is undirected Directed graph: each edge has a direction Complete graph: any two points have an edge connected Sparse gr ...