Java 2D Path deletion
<p>I need to take a 2D array of integers and, starting from the bottom, find a path to the top with the shortest numbers essentially. So I need to go through the bottom row, find the lowest number, then check the number to the top left, top, and top right of that number and see which one is the smallest, and do that all the way to the "top" of the array. After I find that path I need to delete it. My question is what is the best way to store that path, should I use another array? Second, how do I actually delete it? Would setting that array to null do the trick or would that just set the element to null instead of deleting it? This should work for more than one path also, so say the lowest number on the bottom row is 5, and there are 3 5s, it should delete 3 paths (unless they come together at some point) </p>
