Programming VIP

The theoretical content is recorded in the code Capriccio. Here I mainly write my own explanation and review, which is highly recommended Code capriccio, code Capriccio PDF, code Capriccio Baidu online disk, code Capriccio knowledge planet, code Capriccio octet PDF, code Capriccio brush question route, code Capriccio knowledge planet octethttp ...

Day 29 I use C++, forgive me for the mistake. The article was meant to urge me to learn. I would be very happy if it happened to help you. I. 39. Combination Sum Give you an array of integers with no duplicate elements, candidates, and a target integer target, find all the different combinations in candidates that can make numbers and tar ...

1. Overview of arrays During the execution of a program, a large amount of data is often stored. Java and many advanced languages provide a data structure called an array that can be used to store an ordered set of fixed number of elements with the same element type. Array mainly solves the storage problem of multivariable and multidata, and fa ...

I Title Description Give you a binary matrix grid of size m x n. Islands are a combination of adjacent ones (representing land). The "adjacent" here requires that two ones must be adjacent in four horizontal or vertical directions. You can assume that all four edges of the grid are surrounded by 0 (representing water). The area of ...

1, Title [LeetCode-198] You are a professional thief who plans to steal houses along the street. There is a certain amount of cash hidden in each room. The only restrictive factor affecting your theft is that the adjacent houses are equipped with interconnected anti-theft systems. If two adjacent houses are intruded by thieves on the same nigh ...

392. Judgment subsequence 1. Title Given the strings S and t, judge whether s is a subsequence of t. A subsequence of a string is a new string formed by deleting some (or not deleting) characters from the original string without changing the relative position of the remaining characters. (for example, "ace" is a subsequence of &quo ...

On the boundary problem of dichotomy and two writing methods We are familiar with the binary search method. For an ordered sequence, we can use the binary search method in O ( l o g N ...

greedy Greedy algorithm or greedy idea adopts greedy strategy to ensure that each operation is locally optimal, so that the final result is globally optimal. assignment problem 455. Distribution of biscuits Suppose you are a great parent and want to give your children some cookies. However, each child can only give one biscuit at most. Fo ...

Algorithm - stack and queue: connected to rain Give a row of columns with width of 1 and height of n, and calculate the area that can receive rainwater. Train of thought analysis: Method 1: using the double pointer method, calculate by column. The first column and the last column do not receive rainwater. Because the width is 1, the area of ...

leetcode daily question 1744. Can you eat your favorite candy on your favorite day? My thoughts For each query in the querie s, you can calculate the minimum number of meals (equal to days) and the maximum number of meals (equal to days) × The maximum number you can eat per day). According to example 2, we can think that if we calcula ...