You will be given various arrays, composed of numbers or strings. For this problem, the known pattern unit length is three. Write a function to determine if the supplied array is a strict repeating pattern. The array will have a length that is a multiple of three.
For example, [1 2 3 1 2 3 1 2 3] would return true since the first block ([1 2 3]) is strictly repeated through the remainder of the array. On the other hand, [1 2 3 1 2 3 2 2 3] would return false, since the last block is [2 2 3] rather than [1 2 3], as indicated by the first block.
This problem is a precursor to Problem 3069 and Problem 3070.
Solution 849419
Not sure why this solution gets marked as incorrect. I haven't been able to stump it. Can you find something wrong?
function [tf] = pattern_recognition1(array)
L = length(array);
one=array(1:3:L); two=array(2:3:L); three=array(3:3:L);
check = ((length(one) + length(two) = length(three)) /length(one);
c1 = all(one == one(1)); c2 = all(two == two(1)); c3 = all(three == three(1));
if c1 ==1 && c2 == 1 && c3 == 1
if check == 3;
tf = 1;
else tf = 0;
end
else tf = 0;
end
Line 5, replace 2nd "=" with "==".