下列关于01背包问题的动态规划空间优化代码，正确的是？

for (int i = 0; i < n; i++) {
    for (int j = 1; j <= bagCapacity; j++) {
        if (j >= weight[i]) {
            dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
        }
    }

for (int i = 0; i < n; i++) {
    for (int j = bagCapacity; j >= weight[i]; j--) {
        dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
    }

for (int i = 0; i < n; i++) {
    for (int j = weight[i]; j <= bagCapacity; j++) {
        dp[i][j] = max(dp[i][j], dp[i][j - weight[i]] + value[i]);
    }

for (int j = bagCapacity; j >= 0; j--) {
    for (int i = 0; i < n; i++) {
        if (j >= weight[i]) {
            dp[j] = dp[j - weight[i]] + value[i];
        }
    }