Integer Break

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).

class Solution {public:    int integerBreak(int n) {    int* arr;    arr = new int[n + 1];    arr[1] = 1;        int temp;    for(int i = 2; i <= n; i++){    temp = i - 1;    for(int j = 2; j <= i / 2; j++){    if(j * arr[i - j] > temp)    temp = j * arr[i - j];    if(j * (i - j) > temp)    temp = j * (i - j);    }    arr[i] = temp;    }    return arr[n];    }};