## Project Euler – Problem 18

Problem 18: Find the maximum sum travelling from the top of the triangle to the base.

``` import java.util.Vector; public class test { public static void main(String[] args) { String triangle = "75\n"+ "95 64\n"+ "17 47 82\n"+ "18 35 87 10\n"+ "20 04 82 47 65\n"+ "19 01 23 75 03 34\n"+ "88 02 77 73 07 63 67\n"+ "99 65 04 28 06 16 70 92\n"+ "41 41 26 56 83 40 80 70 33\n"+ "41 48 72 33 47 32 37 16 94 29\n"+ "53 71 44 65 25 43 91 52 97 51 14\n"+ "70 11 33 28 77 73 17 78 39 68 17 57\n"+ "91 71 52 38 17 14 91 43 58 50 27 29 48\n"+ "63 66 04 68 89 53 67 30 73 16 69 87 40 31\n"+ "04 62 98 27 23 09 70 98 73 93 38 53 60 04 23"; String[] lines = triangle.split("\n"); Vector> map = new Vector>(); //populate vector for(int i = 0; i < lines.length; i++){ String[] line = lines[i].split(" "); Vector sub = new Vector(); for(int j=0;j-1;i--){ Vector sub = map.get(i); Vector prev = map.get(i+1); for(int j=0;j prev.get(j+1) ? prev.get(j) : prev.get(j+1))); } } System.out.println(map.get(0).get(0)); } } ```