# 2019/05
题目 Given anon-emptyarray of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit. You may assume the integer does not contain any leading zero, except the number 0 itself. Example 1: Input: [1,2,3] Output: [1,2,4] Explanation: The array represents the integer 123. Example 2: Input: [4,3,2,1] Output: [4,3,2,2] Explanation: The array repr....

[66] Plus One

LeetCode
定义 装饰者模式： 动态的将责任附加到对象上。若要扩展功能，装饰者提供了比继承更有弹性的替代方案。 Java实现 背景 制作咖啡时，不同的调料搭配不同的咖啡，动态的计算价钱。 超类 饮料类 public abstract class Beverage { String description = "Unknown Beverage"; public String getDescription() { return description; } /** * 功能描述: 价钱 * * @return double * @author liyf */ public abstract double cost(); } 具体咖啡类 需要为具体的咖啡设置描述，而且还必须实现cost()方法 浓缩咖啡 public class Espresso extends Beverage { public Espresso() { description = "Espresso"; } @Override public double cost() { return 1.99; } } 综合咖啡 pub....

装饰者模式

题目 The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1is read off as"one 1"or11. 11is read off as"two 1s"or21. 21is read off as"one 2, thenone 1"or1211. Given an integer_n_ where 1 ≤_n_≤ 30, generate the_n_thterm of the count-and-say sequence. Note: Each term of the sequence of integers will be represented as a string. Example 1: Input: 1 Output: "1" Example 2: Input: 4 Output: "1211" 解法 一 思路 遍历时使用变量记录当前数字及次数....

[38] Count and Say

LeetCode