In test #1 answer could be [1 4 2 3], couldn't it? It gives tt = 10, same as proposed [1 2 4 3].
You're correct, Jan. Both options give you a minimum time of 10.
Additional test cases have been added.
I think that ones(4) in Test #3 should be eye(4), instead. Also, #1 has to be fixed as Jan pointed out.
The corrections mentioned by Yuichi (and Jan) have been made.
How to proceed with larger matrix (where permutations are too expensive) ?
Should not need the '=' in the 'if j<=t' statement to get the "correct" answer, but that makes the code match the solution in the test suite.
Maximum running product for a string of numbers
Matrix with different incremental runs
Integer Sequence - II : New Fibonacci
Max Change in Consecutive Elements
Number of Even Elements in Fibonacci Sequence
Find the treasures in MATLAB Central and discover how the community can help you!
Select a Web
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