public void Test_1() { int[,] matrix = { { 131, 673, 234, 103, 18 }, { 201, 96, 342, 965, 150 }, { 630, 803, 746, 422, 111 }, { 537, 699, 497, 121, 956 }, { 805, 732, 524, 37, 331 } }; var sut = new E082PathSumThreeWays(); Assert.Equal(994, sut.GetMinimalPathSum(matrix)); }
public void Solution() { /* * Find the minimal path sum, * from the top left to the bottom right by only moving up, down, and right,. */ var matrix = ReadMatrix(); var sut = new E082PathSumThreeWays(); Assert.Equal(260324, sut.GetMinimalPathSum(matrix)); /* * Congratulations, the answer you gave to problem 82 is correct. * You are the 18541st person to have solved this problem. * This problem had a difficulty rating of 20%. */ }