Programmer Think

Title Link: Portal Title password: 202201150000 Data connection: Counting Inverse element Inclusion exclusion principle Extended Euclid Learning the game of taking stones in game theory Title Content: Here is the reference mathematical problem A - A^B Mod C Idea: this topic can think of violence first, but the data is too large, s ...

Monotone stack Is it time to use monotone stack We must remember that the data structure must assist us in solving problems, and must be optimized in the way of violent solution (in fact, space for time) The monotone stack must meet the first in first out feature when processing data, just as we must meet the first in first out feature w ...

The sorting time complexity of bubbling, insertion and sorting is O(n2), which has high time complexity and is suitable for small-scale data processing. For large-scale data sorting, merge sorting and quick sorting are more suitable. Both merge sort and quick sort use the idea of divide and rule. Merge sort The idea of merging and sorting ...

A. metal collection Searched. It's found that it's a tree dp. This thing really doesn't, and it hasn't been done... So I can't understand it for the time being.. B solution of univariate cubic equation Solution idea: use floating-point numbers to enumerate from negative numbers to positive numbers. According to the position of t ...

😈 Blog home page: 🐼 Hello, everyone. My name is classmate Zhang🐼 💖 Welcome to praise 👍 Collection 💗 Leaving a message. 📝 Welcome to discuss! 👀 🎵 This article was originally written by [Hello, my name is classmate Zhang] and started at CSDN 🌟🌟🌟 ✨ Boutique column (updated from time to time) [data structure + algorithm] [notes][C l ...

Five implementation strategies of pytoch's spatial shift operationThis article has authorized the platform of the polar city and is the official account of the polar platform. No second reprint is allowed without permissionOriginal document (may be further updated): https://www.yuque.com/lart/ug...prefacePreviously, I read some papers that use ...

Question 1: merging binary trees LeetCode 617 : Merge binary tree Description: Given two binary trees, imagine that when you overlay one of them on the other, some nodes of the two binary trees will overlap. You need to merge them into a new binary tree. The merging rule is that if two nodes overlap, their values are added as the new value ...

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 ...

👏 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! L ...

⚡ 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 ...