Triangle

Description

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

Notice

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.

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).

我的错误分析：开始的时候我是从上往下开始算。直接找相邻两个中较小的计算，以为这样就可以得到的和最小。—这个是我的思维大漏洞。。。错误代码如下：

public int minimumTotal(int[][] triangle) {
        int result=triangle[0][0];
        int j=0;
        for(int i=1;i<triangle.length;i++){
           result+=(triangle[i][j]<triangle[i][j+1])?triangle[i][j]:triangle[i][++j];
        }
        return result
   }

正确的是每一条路线都要比较。较好的算法是from bottom to top.

public int minimumTotal(int[][] triangle) {

        int length=triangle.length  ;
        if(length==0)return 0;  
        if(length==1)return triangle[0][0];  
        for(int i=triangle.length-2;i>=0;i--)  
        {  
            for(int j=0;j<triangle[i].length;j++)  
            {  
                triangle[i][j]=(triangle[i+1][j]<triangle[i+1][j+1]?triangle[i+1][j]:triangle[i+1][j+1])+triangle[i][j];  
            }  
        }  
        return triangle[0][0];  
    }

分析的话看着个网址：http://blog.csdn.net/jin_kwok/article/details/51418353