At first I thought that I needed a special case to avoid zeros. However, if you can move past a zero to a non-zero, that is always a preferred move, and if not, a move to a location before the zero which allows you to move past the zero is also better. If no such move exists, there is no way to get to the end. Don
On Jan 27, 12:23 pm, sravanreddy001 <[email protected]> wrote: > @Don: > > The solution looks good... > I can see that the greedy choice property is holding.. and its optimal > too... > > max (j+a[J]) maximizing is leading us to the farthest possible position, > > but.. in the beginning.. i thought.. this will have probs with 0's > but.. couldn't come up an example, for which ur approach fail and there's > soultion for it. -- 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.
