aspose file tools*
The moose likes Java in General and the fly likes anyone good at dynamic programming? Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
JavaRanch » Java Forums » Java » Java in General
Bookmark "anyone good at dynamic programming?" Watch "anyone good at dynamic programming?" New topic
Author

anyone good at dynamic programming?

Randall Twede
Ranch Hand

Joined: Oct 21, 2000
Posts: 4347
    
    2

i was certain i had solved this one rather quickly, but i get the wrong answer. i am new to dynamic programming and any clues on how to debug this would be appreciated.
the problem:
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.


131 673 234 103 18
201 96 342 965 150
630 803 746 422 111
537 699 497 121 956
805 732 524 37 331


Find the minimal path sum, in matrix.txt (right click and 'Save Link/Target As...'), a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by only moving right and down.

my code:

the problem must be somewhere in the try block.


SCJP
Visit my download page
Randall Twede
Ranch Hand

Joined: Oct 21, 2000
Posts: 4347
    
    2

never mind, i think i found it
Randall Twede
Ranch Hand

Joined: Oct 21, 2000
Posts: 4347
    
    2

i fixed the obvious problem. i wasn't adding i was assigning. my answer is now much closer to the correct answer. i get 409646, correct answer is 427337
 
I agree. Here's the link: http://aspose.com/file-tools
 
subject: anyone good at dynamic programming?