Programmer Group

7-1 packing problem import java.util.Scanner; public class Program1 { public static void main(String[] args) { int N; Scanner in = new Scanner(System.in); N = in.nextInt(); int []things = new int[N]; //Up to N boxes int []box = new int[N]; //Record the maximum number of boxes ...

Example: The best time to buy and sell stocks II Given an array prices, where   prices[i] is the price of a given stock on day I. Design an algorithm to calculate the maximum profit you can make. You can complete as many transactions as possible (buying and selling a stock multiple times). Note: you cannot participate in multiple t ...

The so-called greedy algorithm is to ensure that each operation is a local optimal solution, so that the final result is a global optimal solution. Exercise 1:455. Distribute cookies The key to using greedy algorithm is to find greedy strategy, that is, each operation is a local optimal solution. As can be seen from the question, to satisf ...

        About the language part of C + + (Information Science Orsay one pass), I myself summarized some knowledge.         Because it is too basic, I won't talk about the introduction and use of the first part of the source code.         I'll start with the second chapter, sequent ...

Competition link: Click here to transfer Link to official solution: Click here to transfer 1573A Countdown topic link: Click here to transfer Meaning: There is a sequence, you have to change it all into 0. You can perform the following two operations to exchange elements in two positions, which is the last element minus one. Find the minim ...

Competition link: Click here to transfer Link to official solution: Click here to transfer 1562A The Miracle and the Sleeper topic link: Click here to transfer Meaning: Given a range [ l , r ] ...

subject Source: LeetCode Link: https://leetcode-cn.com/problems/text-justification Given an array of words and a length maxWidth, rearrange the words into text with exactly maxWidth characters per line and aligned left and right ends. You should use "greedy algorithm" to place a given word; That is, put as many words in each line as ...