diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/integer_break.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/integer_break.cpp')
-rw-r--r-- | other/integer_break.cpp | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/other/integer_break.cpp b/other/integer_break.cpp deleted file mode 100644 index c015be2..0000000 --- a/other/integer_break.cpp +++ /dev/null @@ -1,20 +0,0 @@ -#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); -} |