CF1550E - Stringforces - binary answer, shape pressure DP

E - Stringforces Title Description Give you a include? And before k k k lowercase strings s s s. You need to put each? Replace with previous k ...

Posted by DataRater on Sun, 16 Jan 2022 19:44:58 +0100

[Java design pattern] explain three factory patterns in detail with pizza ordering cases

👏 About the author: Hello, I'm cabbage ~ ~, a sophomore in school, and a new star creator in the Java field.📝 Personal homepage: Cabbage CSDN blog📕 Series column: This article is written in the Java design pattern column: Isn't that the Java design pattern📧 If there are mistakes in the knowledge points of the article, please correct them! Learn ...

Posted by michaelk46 on Sun, 16 Jan 2022 16:04:24 +0100

Minimum heap maximum heap understand? To understand the application of heap in the front end

⚡ preface We all know that a tree is a data structure, but we may rarely hear of the data structure heap. In fact, heap is a special kind of complete binary tree. For the front end, we usually know the maximum heap and minimum heap, and we often use the maximum heap and minimum heap to solve various problems. For example, the K largest e ...

Posted by pbdude23 on Sun, 16 Jan 2022 14:07:45 +0100

Bitmap (Java based implementation)

The so-called bitmap is to use each bit to store a certain state. It is suitable for large-scale data, but there are not many data states. It is usually used to judge whether a data store exists. Design principle: Maximize the use of memory as much as possible, and maximize the mining, utilization and performance of Java. Design idea: ...

Posted by -[ webdreamer ] on Sun, 16 Jan 2022 13:28:57 +0100

LeetCode 04 question - find the median of two positive arrays

LeetCode 04 question - > find the median of two positive arrays 1. Title Description Find the median of two positively ordered arrays Give two positively ordered (from small to large) arrays nums1 and nums2 of sizes m and N, respectively. Please find and return the median of these two positive arrays. The time complexity of the algorithm ...

Posted by alasxdair on Sun, 16 Jan 2022 12:34:47 +0100

[LeetCode] determine a binary tree

preface This paper shows the topics related to determining a binary tree in LeetCode, which readers can use to write by dictation to check whether they are familiar with the relevant algorithms. The difficulty is medium. LeetCode topic Related topic types Related links 105 Constructing binary tree from preorder and inorder traversal sequ ...

Posted by mazman on Sun, 16 Jan 2022 05:50:18 +0100

[matrix continued multiplication] "dynamic programming" -- algorithm design and analysis (Fifth Edition)

1, Algorithm requirements Given n matrices {A, A, A,,..., An}, where Ai and Ai + 1 (I = 1, 2,..., n-1) are multiplicative. The order of matrix multiplication is expressed by the method of adding brackets. The calculation amount (multiplication times) is different in different calculation orders. Find A method of adding brackets to minimi ...

Posted by scept1c on Sun, 16 Jan 2022 04:02:16 +0100

Algorithm basic enumeration

t1 fake coin poj1013 Idea: First of all, you should know that the subject already knows the weighing results, and each input is three groups of data, so define three character arrays to store three groups of data of the left balance, three groups of data of the right balance and three groups of data of the weighing results, and then define an ...

Posted by bizshop on Sat, 15 Jan 2022 23:50:47 +0100

Joseph problem (array + queue + formula iteration + recursion)

Joseph problem (array + queue + formula iteration + recursion) The Joseph Ring problem originates from a Jewish story: The Romans captured the bridge Tapat, and 41 people hid in a cave to escape the catastrophe. Among the 41 people, the historian Josephus (Joseph) and one of his friends. The remaining 39 people decided to commit collective sui ...

Posted by QbertsBrother on Sat, 15 Jan 2022 22:59:10 +0100

Analysis of Luogu cf803a maximum binary matrix

Source of original title: CodeForces 803A Title Description: You are given matrix with n rows and n columns filled with zeroes. You should put k ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographical ...

Posted by runsum on Sat, 15 Jan 2022 18:31:23 +0100