Approach 1: 2D DP
- Time:O(nk), where k = (\Sigma \texttt{nums[i]} + S) / 2
- Space:O(nk)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: 1D DP
- Time:O(nk)
- Space:O(k)
C++ |
---|
|
JAVA |
---|
|