This solution together with the solution of James' (or mine) exhibits a nice duality between the "top-down" and "bottom-up" approaches.
Nice! When you go from the bottom, solution automatically goes to a(1).
Thanks. I coded that solution up LONG before movmax became a thing...
Replace NaNs with the number that appears to its left in the row.
letter yes yes & letter no no
Create an n-by-n null matrix and fill with ones certain positions
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
Project Euler: Problem 14, Longest Collatz sequence
Project Euler: Problem 11, Largest product in a grid
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office