leetcode 92: Triangle

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle

[
     [2],
    [3,4],
   [6,5,7],
  [4,1,8,3]
]

The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).

Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

public class Solution {
    public int minimumTotal(List<List<Integer>> triangle) {
        int len = triangle.size();
        int [] d = new int[len];
        
        for(int i=0; i<len; i++) 
            d[i] = triangle.get(len-1).get(i);
        
        for(int i=len-2; i>=0; i--) {
            for(int j=0; j<triangle.get(i).size(); j++) {
                d[j] =triangle.get(i).get(j) + Math.min( d[j], d[j+1]  );                    
            }
        }
        
        return d[0];
    }
}

1st recursive. cannot pass big test set.

public class Solution {
    private int min;
    
    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
        // Start typing your Java solution below
        // DO NOT write main() function
        //check corner case here.
        if(triangle == null) return 0;
        if(triangle.size()==0) return 0;
        
        this.min = Integer.MAX_VALUE;
        minRec(triangle, 0, 0, 0);
        return min;
    }
    
    private void minRec(ArrayList<ArrayList<Integer>> triangle, int index, int temp, int level) {
        
        
        //if(temp>=min) return;  zzzzz wrong! if negative number exist.
        temp += triangle.get(level).get(index);
        
        if( level== triangle.size()-1) {
            min = min<temp? min : temp;
            return;
        }
        
        minRec(triangle, index, temp, level+1);
        minRec(triangle, index+1, temp, level+1); 
        
    }
}

2nd try works, use dynamic programming. from n->1. not 1->n. dynamic programming want to reduce to one points. In this case, we only use half of the matrix. Since the ith result only depends on i+1 th result. we can only use one array instead of matrix.

public class Solution {
    private int min;
    
    public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
        // Start typing your Java solution below
        // DO NOT write main() function
        //check corner case here.
        if(triangle == null) return 0;
        if(triangle.size()==0) return 0;
        int sz = triangle.size();
        
        int[] d = new int[sz];
        //int[] nd = new int[sz];
        ArrayList<Integer> temp = triangle.get(sz-1);
        for(int i=0; i<sz; i++) {
            d[i] = temp.get(i);
        }
        
        
        for(int i=sz-2; i>=0; i-- ) {
            for( int j=0; j<=i;j++) {
                d[j] = triangle.get(i).get(j) + Math.min(d[j], d[j+1]);
            }            
        }
        
        return d[0];
    }
}

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        int sz = triangle.size();
        if(sz<1) return 0;
        
        vector<int> b = triangle[sz-1];
        
        for(int i=sz-2; i>=0; i--) {
            for(int j=0; j<triangle[i].size(); j++) {
                b[j] = triangle[i][j] + min(b[j], b[j+1]);
            } 
        }
        return b[0];
    }
};