mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-28 04:56:28 +08:00
10c397b172
* feat: Add Dart codes for chapter_dynamic_programming * feat: Add Dart codes for chapter_greedy
37 lines
816 B
Dart
37 lines
816 B
Dart
/**
|
||
* File: max_product_cutting.dart
|
||
* Created Time: 2023-08-11
|
||
* Author: liuyuxin (gvenusleo@gmail.com)
|
||
*/
|
||
|
||
import 'dart:math';
|
||
|
||
/* 最大切分乘积:贪心 */
|
||
int maxProductCutting(int n) {
|
||
// 当 n <= 3 时,必须切分出一个 1
|
||
if (n <= 3) {
|
||
return 1 * (n - 1);
|
||
}
|
||
// 贪心地切分出 3 ,a 为 3 的个数,b 为余数
|
||
int a = n ~/ 3;
|
||
int b = n % 3;
|
||
if (b == 1) {
|
||
// 当余数为 1 时,将一对 1 * 3 转化为 2 * 2
|
||
return (pow(3, a - 1) * 2 * 2).toInt();
|
||
}
|
||
if (b == 2) {
|
||
// 当余数为 2 时,不做处理
|
||
return (pow(3, a) * 2).toInt();
|
||
}
|
||
// 当余数为 0 时,不做处理
|
||
return pow(3, a).toInt();
|
||
}
|
||
|
||
/* Driver Code */
|
||
void main() {
|
||
int n = 58;
|
||
|
||
// 贪心算法
|
||
int res = maxProductCutting(n);
|
||
print("最大切分乘积为 $res");
|
||
}
|