new_contents: class Solution:
      # @param triangle, a list of lists of integers
      # @return an integer
  
      def minimumTotal(self, triangle):
          n = len(triangle)
          dp = triangle[-1]
          for i in xrange(n-2, -1, -1):
              for j in xrange(i+1):
                  dp[j] = triangle[i][j] + min(dp[j], dp[j+1])
          return dp[0]
  
subject: add solution for Triangle