Smallest JAVA soln without DP, Recursion
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public int integerBreak(int n) {\n         if(n<=3){\n            return n-1;\n        }\n        int ans=1;\n        while(n>4){\n            ans=ans*3;\n            n=n-3;\n        }\n        ans=ans*n;\n        return ans;\n    }\n}\n```
['Java']