Top-Down DP will work well. On Thu, Sep 30, 2010 at 2:27 AM, Christi Massey <[email protected]> wrote: > A table composed of N*M cells,each having a certain quantity of apples, is > given. you start from the upper-left corner. At each step you can go down or > right one cell.Design an algorithm to find the maximum number of apples you > can collect ,if you are moving from upper-left corner to bottom-right > corner. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. >
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
