Original solution I created by digging through documentation was x=a~=0; y=sum(x,2); [M,I]=max(y); r=max(y). Solution had a size of 31 so I compressed it into it's current version.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = [ ...
1 2 0 0 0
0 0 5 0 0
2 7 0 0 0
0 6 9 3 3];
r_correct = 4;
assert(isequal(fullest_row(a),r_correct))
|
2 | Pass |
a = [ ...
1 2 0 0
0 0 5 0
0 6 9 -3
2 7 0 0
0 0 0 0];
r_correct = 3;
assert(isequal(fullest_row(a),r_correct))
|
3 | Pass |
a = [ ...
1 0 0
0 0 0
0 0 0
0 0 0
0 2 3];
r_correct = 5;
assert(isequal(fullest_row(a),r_correct))
|
4 | Pass |
a = [ ...
0
0
0
-3
0
0];
r_correct = 4;
assert(isequal(fullest_row(a),r_correct))
|
Find the alphabetic word product
2321 Solvers
606 Solvers
Replace NaNs with the number that appears to its left in the row.
2018 Solvers
338 Solvers
359 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!