Very elegant method to generate and utilize created optimal scores from the left. This solution is very fast and nearly linear with size.
It is not close to linear. Richard, since he is using the function max for every number. It is at least O(n^2), in which n is size, and maybe even a little bit more since he is using indexing, another comparison(besides max), creating new arrays and so on. His code is small and functional though: kudos.
Find the longest sequence of 1's in a binary sequence.
Solve the Sudoku Row
Sum of diagonals elements of a matrix
Product of elements in row
GJam March 2016 IOW: Clock Dance
Elastic Collision 001: 1-D
Mastermind III: Solve in 1
Criss_Cross_000 : Unique elements in a Square array
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