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

解题思路1：开辟一个数组用于存放一条线路保存下来的数，通过递归比较每条线路的值确定最优.这里用上下层的数位置索引号相连条件来剪枝，减少遍历数.

#include<iostream>
#include<vector>
#include<numeric>
#include<algorithm>

using namespace std;


int FinalResult = INT_MAX;
void SearchMinSum(vector<vector<int> > &triangle,vector<int>&result,int idx, int level)
{
	if (level==triangle.size())
	{
		FinalResult = FinalResult < accumulate(result.begin(), result.end(), 0) ? FinalResult : accumulate(result.begin(), result.end(), 0);
		return;
	}
	for (int i = 0; i < triangle[level].size();++i)
	{
		if (i==idx||i==idx+1)
		{
			result.push_back(triangle[level][i]);
			SearchMinSum(triangle, result, i, level + 1);
			result.pop_back();
		}
	}
}
int minimumTotal(vector<vector<int> > &triangle) {
	vector<int>SumResult;
	SearchMinSum(triangle, SumResult,0,0);
	return FinalResult;
}

结果超时了，这里只开辟了一个最优路径的空间，在递归过程中使用了过多的删除插入操作；

解题思路2：采用动态规划的思想，开辟更大的内存空间来换取时间上的节省

#include<iostream>
#include<vector>
#include<numeric>
#include<algorithm>

using namespace std;

//到某个点的最小值，为该值加上上一层的最小值.这里要考虑边界情况
int minimumTotal(vector<vector<int> > &triangle) {
	vector <vector<int> >SumResult(triangle);
	if (triangle.size() == 0)
		return 0;

	for (int i = 1; i != triangle.size(); ++i)
	{
		for (int j = 0; j != triangle[i].size(); ++j)
		{
			if (j == 0)
				SumResult[i][j] = SumResult[i - 1][j] + triangle[i][j];
			else if (j == triangle[i].size() - 1)
				SumResult[i][j] = SumResult[i - 1][j - 1] + triangle[i][j];
			else
				SumResult[i][j] = (SumResult[i - 1][j] + triangle[i][j]) < (SumResult[i - 1][j - 1] + triangle[i][j]) ? SumResult[i - 1][j] + triangle[i][j] : SumResult[i - 1][j - 1] + triangle[i][j];
		}
	}
	/*int MinSum = SumResult[SumResult.size() - 1][0];
	for (int i = 1; i != SumResult[SumResult.size() - 1].size();++i)
	MinSum = MinSum < SumResult[SumResult.size() - 1][i] ? MinSum : SumResult[SumResult.size() - 1][i];
	return MinSum;*/
	return *min_element(SumResult[SumResult.size() - 1].begin(), SumResult[SumResult.size() - 1].end());
}