Interview questions of dynamic programming of leetcode
1. Maximum sum of continuous subarrays
Enter an integer a...
The sixth sort -- quick sort
void quickSort(vector<int>& v, int left, int right) { if (left >= right)return; int pirot = v[right]; int l...
LeetCode 1320. The second refers to the minimum distance of input -- Dynamic Programming -- interval DP
The second refers to the minimum distance entered The layout of the two finger input method customized keyboard on the ...
LeetCode brush questions - maximum depth of N-ary tree
Preface description
Algorithm learning, daily...
Force button brush question - single linked list series - question 1: remove the elements of the linked list and get a glimpse of the path from the linked list to stop killing God~
Title Link: force buckle Force button brush questions ---- > single chain list series The first solution: operate on...
leetcode brush record day033:203 and 160
203. Simple difficulty: Method 1: Original: new linked list Principle: first, create two new nodes, one as the answer ch...
Sword finger Offer 19. Detailed problem solution of regular expression matching
Sword finger Offer 19. Regular expression matching
...
Rotating array algorithm
1, Title Given an array, move the elements in the array to the right k k k locations, where k k k is a nonnegative numbe...
⭐ Introduction to algorithm ⭐ Stack and queue simple 02 -- LeetCode 225. Implement stack with queue
1, Title
1. Title Description &em...
2021.9.12 Week Race (Greed + Priority Queue + Binary Answer)
Catalog
Array Splitting (Differential + Greedy) Selfish G...
leetcode 5869. Maximum product of two palindrome subsequence lengths [shape pressure DP]
Give you a string s. please find two disjoint palindrome subsequences in s to maximize the product of their lengths. Two...