Programmer Think

sort Sorting is an algorithm that arranges data in a certain order. The following are introduced one by one. 1, Bubble sorting Bubble sorting is to compare the elements between lists in pairs, and the large exchange position is to the right. In the first pairwise comparison, the largest element must be placed on the far right, so the second ...

Original title ha-ha. As we all know, intermarriage is not allowed within five clothes, that is, if the nearest common ancestor of two people is within five generations (i.e. myself, parents, grandparents, great grandparents and high grandparents), they cannot intermarry. Please help a couple to judge whether they can get married or not? Inpu ...

Radar target echo Firstly, the composition and structure of radar target echo are introduced, and then the students have an in-depth understanding of the generation of target echo through code. The echo received by radar can be forward scattering or backward scattering. Backscattering is usually unique to bistatic radar. The signal receiv ...

Original address: https://sean.cm/a/polygon-clipping-pt1 Greiner Hormann clipping algorithm cannot handle coincident lines. So I studied and wrote another article that applies to all polygons. Read on here: Polygon clipping (Part 2) problem First, let's define the problem, Suppose you have two polygons, each in 2D var poly1 = [ // red ...

1, Environment configuration This program needs to import capture-0.3.10 jar,bridj-0.6.2.jar,slf4j-api-1.7.2.jar and slf4j-nop-1.7.26 Jar four jar packages. 2, Realization thought A total of three classes are required, namely, the interface display class (drawpixel), the image (video) processing class (myThread) and the button listener cl ...

In the Taishan edition of Alibaba Java development manual, there are two descriptions about subList What does this mean? Let's analyze: Let's first look at the simple use of subList: List<String> bookList = new ArrayList<>();bookList.add("Kwai Ali");bookList.add("promotion increase ");bookList.add("assume CTO");bookList.add("Ma ...

Problem expression problem analysis The problem itself is easy to understand. Here are two solutions. The key to the problem of the linked list is to pay attention to the pointing between nodes. In addition, pay attention to each node, such as virtual head node, current node, previous node, next node, etc. the memory distribution of the li ...

Introduction to dichotomy and dichotomy Introduction to dichotomy and dichotomy Little story1. Introduction to dichotomy 1.1 time complexity1.2 working principle1.3 space complexity 1.3.1 recursive version1.3.2 non recursive version 1.3.3 binary search of STL 2. Common questions 2.1 binary search2.2 binary search 2.2 ...

236. Nearest common ancestor of fork tree Given a binary tree, find the nearest common ancestor of two specified nodes in the tree. Baidu Encyclopedia defines the nearest public ancestor as: "for two nodes p and q with root tree T, the nearest public ancestor is expressed as a node x, which satisfies that x is the ancestor of p and q, an ...

1: Image addition You can use the function CV2 Add() adds two images. Of course, numpy, res=img1+img can also be used directly. The size and type of the two images must be the same, or the second image can make a simple scalar value. Note: addition in OpenCV is different from addition in Numpy. OpenCV addition is a saturation operation, whil ...