Programmer Think

In graph theory search, single source BFS and multi-source BFS search distance. 1. BFS graph theory search question in leetcode leetcode link: 1162. Map analysis You now have a grid with a size of n x n, and each cell on it is marked with 0 and 1. Where 0 represents the ocean and 1 represents the land. Please find an ocean cell. The dist ...

1, Title Description 2, Problem solving ideas Originally, the simple Kruskal algorithm timed out. After watching the method of the great gods, I learned the chain forward star and multiplication LCA for the first time. The following chain forward star and multiplication LCA are introduced in detail below 3, Chain forward star Chained forw ...

Data structure and algorithm learning notes (9) search I Basic concepts of search Lookup table What is find How to find Purpose of search Classification of lookup tables Evaluation index of search algorithm Research content of search process II Lookup of linear table 1. Sequential search Scope of application Static l ...

Then continue to write the last article.5. Find the largest number in multiple arraysInput: largestOfFour([[13, 27, 18, 26], [4, 5, 1, 3], [32, 35, 37, 39], [1000, 1001, 857, 1]])Output: [27, 5, 39, 1001]Solution:function largestOfFour(arr) { let temp = []; for(let i =0;i<arr.length;i++) { temp.push(Math.max(...arr[i])); } return ...

When I first started to study the course of microcomputer principle, I had a feeling that I couldn't start with assembly language programming. After a semester of practice, I am familiar with the assembly language. I want to organize an article to help the assembly Xiaobai who has just started. 1, Programming environment Let's briefly mention ...

The so-called nested form of recursion, according to my understanding, is that the form of recursion is relatively complex, which can not be made clear in a simple sentence. This requires two layers of recursion for nesting to achieve the purpose. For example, to calculate the number of nodes in a binary tree, the fundamental logic to solve thi ...

preface Hello, I'm "programmer bear" from Huawei. Most children's shoes know that when solving problems related to "linked list", the commonly used problem-solving routines mainly include "double pointer", "iteration" and "virtual head node". Today, "Little Bear" introduces the strat ...

1. Dichotomy Binary search is an algorithm with high time efficiency. Especially in the face of a large amount of data, its search efficiency is very high and the time complexity is log(n). The main idea is to keep folding in half. Half of the data can be removed each time. Finally, all unqualified results are removed, leaving only one ...

Guide to series of articles Guide to series of articles preface After we are familiar with the idea and implementation principle of quick sort, we can bring a lot of inspiration and inspiration in our actual development. With the idea of double pointer walking of quick sort, we can also solve many kinds of quick sort problems. Now let's use ...

1. Introduction 2. Hash table (- 1) related terms 1. Hash method (hash method) Select a function, calculate the storage location of elements by keyword according to the function, and store them according to this. When searching, the same function calculates the address of the given value k, and compares k with the key value of the element ...