Programmer Think

1. Ideas There are some similarities between BM3D and NLM algorithms. NLM has written before: go to They all use the features of other regions of the image and the current block features to fuse into denoised image blocks. The main differences are as follows:         1. Search only within a fixed radi ...

1 sorting overview Let's take a look at the relationship between the eight sorts: 1.1 insert sort 1.1.1 direct insertion sort 1.1.1.1 definition Basic idea: in a group of numbers to be sorted, suppose the front (n-1), in which [n > = 2] numbers are already in good order. Now insert the nth number into the front ordinal number to ma ...

Series Description: [summary of interview algorithm questions] the series mainly summarizes common algorithm questions with each algorithm as a unit. The main questions are derived from the two topics of leetcode's sword finger offer and hot100. The link is as follows: Sword finger offer and hot100 Here is a brief explanation. There may be mu ...

CSDN blog expert is a high-quality creator in the Java field focusing on various technical fields. Wechat search [Chen Pi's JavaLib] and learn more technical articles, interview materials and technical e-books in time after paying attention. preface Suppose you were asked to define a method for others to call. Its function is to travers ...

1 Introduction Recently, I looked at jiangly's CF1638E code and found that jiangly's Kodori tree is implemented with map. So I studied it. CF1638E jiangly code If you haven't come into contact with the Kodori tree, please learn the following first. The principle and set implementation of Kodori tree Complexity analysis of Kodori tree ...

Data structure and algorithm 1. Overview of data structure and algorithm 1.1 general Data structure is a subject that studies the way of organizing data. With programming language, there will be data structure Learning data structure well can write more beautiful and efficient code. Program = data structure + algorithm Data structure is th ...

Basic conditions of enumeration: (1) time conditions: The first is the time condition. Generally speaking, the mainstream OJ can run operations with operands less than 10 ^ 7 under the time limit of 1000ms (generally, it is safer to operate within 10 ^ 6). Therefore, it is best to look at the data range before adopting the enumeration method ...

Full Permutation & permutation combination Realize the nuance of excluding duplicates This article expounds the full arrangement method and arrangement combination. The permutation and combination here uses an example to expand * * (different combinations of target values)** The first is full permutation, which is realized in two ways: 1 ...

Introduction to LeetCode algorithm (day 7) Breadth first search / depth first search 733. Image rendering Solution: it's very hard to read the questions. Look at the examples and understand them. The general meaning is, for example, given the starting point pixel p ...

Foreword: making A, B, D and C has been timeout, and I didn't think of how to optimize it. Rating: 1153 + 146 -- > 1299 (green) Don't talk about the problem, just talk about the solution and code. A. Red and Blue Beans   topic type: greed    analysis: if r is less than B, try to replace 1 with more, so calculate the differenc ...