Find the maximum weight path in a triangle - EPI

Find the maximum weight path in a triangle

triangle.cc Triangle.java
  public static int findMinimumTotal(List<List<Integer>> triangle) {
    if (triangle.isEmpty()) {
      return 0;
    }

    // Stores the minimum path sum of triangle[i - 1].
    List<Integer> prevRow = new ArrayList<>(triangle.get(0));
    for (int i = 1; i < triangle.size(); ++i) {
      // Stores the minimum path sum of triangle[i].
      List<Integer> currRow = new ArrayList<>(triangle.get(i));
      // For the first element.
      currRow.set(0, currRow.get(0) + prevRow.get(0));
      for (int j = 1; j < currRow.size() - 1; ++j) {
        currRow.set(j,
            currRow.get(j) + Math.min(prevRow.get(j - 1), prevRow.get(j)));
      }
      // For the last element
      currRow.set(currRow.size() - 1,
          currRow.get(currRow.size() - 1) + prevRow.get(prevRow.size() - 1));

      prevRow = currRow;
    }
    return Collections.min(prevRow);
  }