Highest value number in a repeating array of ascending numbers

Hi everone,

The data I'm working with is given as a list of numbers that always starts at 1 and increases consecutively to some value, then starts back over at 1 again. Each individual number has its own row in a single column.

For example

1

2

3

1

2

3

4

5

1

2

In this list there are three groups of interest: the group 1-3 (3 max number), 1-5 (5 max number), and 1-2 (2 max number).

I am trying to write a program that spits out the maximum value of each group of consecutive numbers. I've tried a few strategies but am having trouble formatting the data. Any help is very much appreciated!!

[Stephen23]

A = [1;2;3;1;2;3;4;5;1;2;3;4;5;6;1;2];
B = A([diff(A)<0;true])

B = 4×1

3 5 6 2

[Elise Mangin]

This works great too, and I understand the logic behind it. Thank you!

Answer 1

[DGM]

If those simple rules can be depended upon, then

A = [1;2;3;1;2;3;4;5;1;2;3;4;5;6;1;2];

seqpeaks = A(circshift(A==1,-1))

seqpeaks = 4×1

3 5 6 2

[Elise Mangin]

This works beautifully!!! Thank you so much, I was unaware of this circshift fuction.