greedy

How to solve this question asked in premium coding contest?

不打扰是莪最后的温柔 提交于 2020-08-19 05:49:48
问题 Could someone guide me on how to solve this programming question? It seems something like DP problem which I couldn't find answer for. Question: There are ‘n’ ads. Each ad has an effectiveness value associated with it which is given in an array of size ‘n’ in the format [v1, v2, …, vn], where ‘v1’ is the effectiveness value of the first ad, ‘v2’ is the effectiveness value of the second ad, and so on. The show in which these ads will be shown is ‘m’ length long (starting from 0 till m), and

[leetcode] Integer to Roman

喜夏-厌秋 提交于 2020-03-01 12:06:10
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. https://oj.leetcode.com/problems/integer-to-roman/ 思路1:构造法,每一位构造然后拼接。每一位表示的字母虽然不同,但是规则是一样的,所以考虑每一位上0-9的表现形式,然后拼接起来。(详见参考1) 思路2:采用贪心策略,每次选择能表示的最大的值,把对应的字符串连接起来,代码及其简洁。 贪心: public class Solution { public String intToRoman(int num) { String[] str = new String[] { "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" }; int[] val = new int[] { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }; StringBuilder sb = new StringBuilder(); for (int i = 0; num > 0; i++) { while

How to make a preprocessor macro greedy?

回眸只為那壹抹淺笑 提交于 2020-01-24 05:47:10
问题 We have the following preprocessor macro. Its used to help with Doxygen documentation because Doxygen has troubles with C++ and some template typedefs: #if defined(DOXYGEN_PROCESSING) # define DOCUMENTED_TYPEDEF(x, y) class y : public x {}; #else # define DOCUMENTED_TYPEDEF(x, y) typedef x y; #endif It works great when X is a non-template or has only one template parameter. However, if X is a template with multiple parameters: DOCUMENTED_TYPEDEF(Foo<R,S>,Bar); Then it results in compile