The question is located at: https://leetcode.com/problems/triangle/

Here is my solution:

```
public class Solution {
public int minimumTotal(List<List<Integer>> triangle) {
//loop the triangle list
int total = 0;
for (List<Integer> list : triangle){
total += Collections.min(list);
//System.out.println(total);
}
return (int)total;
}
}
```

The test case was: [[-1],[2,3],[1,-1,-3]]

Wouldn't the smallest path be -1 + 2 + (-3) = -2

Why is the expected answer is -1 ? Did I miss something very obvious?