Given an integer n, make an n-by-n matrix as shown below. The a(1,1) should be 0. As we move away from the top-left, the number increase by 1, until we hit a diagonal, where all the elements are (n-1) along the diagonal. After passing diagonal, the number increases by 1 each time.
This is a follow-up question to Cody Challenge CheckerBoard Problem at https://www.mathworks.com/matlabcentral/cody/problems/4-make-a-checkerboard-matrix
For n=10
Input n = 10 Output a is [0 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 8 2 3 4 5 6 7 8 9 8 7 3 4 5 6 7 8 9 8 7 6 4 5 6 7 8 9 8 7 6 5 5 6 7 8 9 8 7 6 5 4 6 7 8 9 8 7 6 5 4 3 7 8 9 8 7 6 5 4 3 2 8 9 8 7 6 5 4 3 2 1 9 8 7 6 5 4 3 2 1 0]
Additional test cases have been added.
I am new to MATLAB and this was first problem I created. So happy to see variety of solutions I could not think of! Thanks and enjoy coding!
Bravo! You are the leading solver!
I didn't know "rot90" before. I was looking for it. Thanks!
(I solved this problem with different function.)
14361 Solvers
749 Solvers
196 Solvers
197 Solvers
Write a function man that takes a row vector v and returns a matrix H as follows..
230 Solvers