Cody

Solution 2003071

Submitted on 5 Nov 2019 by Weiyang Zhang
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
a = 'no extra spaces'; b = 'no extra spaces'; assert(isequal(b,removeSpaces(a)))

b = 1×15 logical array 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 ind_first = 0 ind_end = 16 ind_first = 1 ind_end = 15 b = 'no extra spaces'

2   Pass
a = ' lots of space in front'; b = 'lots of space in front'; assert(isequal(b,removeSpaces(a)))

b = 1×28 logical array 0 0 0 0 0 0 1 1 1 1 0 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 1 1 ind_first = 0 ind_end = 29 ind_first = 7 ind_end = 28 b = 'lots of space in front'

3   Pass
a = 'lots of space in back '; b = 'lots of space in back'; assert(isequal(b,removeSpaces(a)))

b = 1×27 logical array 1 1 1 1 0 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 1 0 0 0 0 0 0 ind_first = 0 ind_end = 28 ind_first = 1 ind_end = 21 b = 'lots of space in back'

4   Pass
a = ' space on both sides '; b = 'space on both sides'; assert(isequal(b,removeSpaces(a)))

b = 1×29 logical array 0 0 0 0 0 0 1 1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 1 1 0 0 0 0 ind_first = 0 ind_end = 30 ind_first = 7 ind_end = 25 b = 'space on both sides'

5   Pass
a = sprintf('\ttab in front, space at end '); b = sprintf('\ttab in front, space at end'); assert(isequal(b,removeSpaces(a)))

b = 1×31 logical array 1 1 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 0 0 0 0 ind_first = 0 ind_end = 32 ind_first = 1 ind_end = 27 b = ' tab in front, space at end'