diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/integer_break.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/integer_break.cpp')
-rw-r--r-- | other/integer_break.cpp | 20 |
1 files changed, 20 insertions, 0 deletions
diff --git a/other/integer_break.cpp b/other/integer_break.cpp new file mode 100644 index 0000000..c015be2 --- /dev/null +++ b/other/integer_break.cpp @@ -0,0 +1,20 @@ +#include "leetcode.h" + +class Solution { +public: + int integerBreak(int n) { + if (n <= 2) + return true; + vector<int> arrMax(n + 1, 0); + arrMax[1] = 0, arrMax[2] = 1; + for (int i = 3; i <= n; i++) + for (int j = 1; j < i; j++) + arrMax[i] = max(arrMax[i], max(j * (i - j), j * arrMax[i - j])); + return arrMax[n]; + } +}; + +int main() { + Solution obj; + cout << obj.integerBreak(2); +} |