Hard to understand the dynamtic programming part of Leetcode question 494, Target Sum

Question

I found this solution which is extremely fast(beats 99.5%) and space-saving(beats 95%) at the same time. I understand most part, except the line: dp[j]=dp[j]+dp[j-num]