p343

发表于 | 分类于 |

LeetCode P343 Reverse String 题解

1.题目：

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).

Note: you may assume that n is not less than 2.

题意：给一个数，返回他拆分之后乘积最大的答案 乘的越多次越好

2.代码

[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
 
package leetcode;

import java.util.Scanner;

/**
 * 
 * @author ZhangMengRou
 *
 */
 public static int integerBreak(int n) {

		int ans = 1;

		if (n == 4) {
			return n;
		}
		if (n == 3) {
			return 2;
		}
		if (n == 2) {
			return 1;
		}
	
		while (n > 4) {
			ans = ans * 3;
			n = n - 3;

		}
		ans = ans * n;
		return ans;
	}

3.一些总结：