it is not easy to reduce the scale of code like this. something in this solution is quite inspiring. THX.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
times = {'1:00' '1:59'};
y_correct = ['1:00' 24];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
2 | Pass |
times = {'2:07' '2:29'};
y_correct = ['2:11' 3];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
3 | Pass |
times = {'3:03' '4:04'};
y_correct = ['3:11' 4];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
4 | Pass |
times = {'5:55' '7:11'};
y_correct = ['6:15' 3];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
5 | Pass |
times = {'7:17' '9:00'};
y_correct = ['8:17' 3];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
6 | Pass |
times = {'5:55' '9:00'};
y_correct = ['6:15' 3];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
7 | Pass |
times = {'1:00' '9:59'};
y_correct = ['1:00' 24];
[t_s,num] = equation_times_run(times);
assert(isequal([t_s,num],y_correct))
|
103 Solvers
233 Solvers
Given a window, how many subsets of a vector sum positive
673 Solvers
261 Solvers
1496 Solvers