Solution to problem 18

- Does not use brute force.
- Rather, the algorithm goes through each level
  to figure each path node's maximum "score"--that
  is, which of the numbers directly above it are
  greater and choose that to add to current node.
  This ensures that a node always has a max score
  until we reach the bottom level and figure out
  which of the final nodes has the maximum value.