Sort a n array for maximum number of recurring values and storing the indexes corresponding to erased components

Question

Alessandro Togni 2021-1-20

1
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/722289-sort-a-n-array-for-maximum-number-of-recurring-values-and-storing-the-indexes-corresponding-to-erase

编辑： Matt J 2021-1-20

采纳的回答： Matt J

Hi,

i'm working with an array of thousands of elements and i've to limit the repeated values to 10.

Let say:

a=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9];

has to become:

[0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,9].

And i want to store the indexes corresponding to the erased 10+-times recurrent values.

Any suggestion would be appreciated.

Thanks in advance,

Alessandro

2 个评论
显示无隐藏无

Matt J 2021-1-20

And i want to store the indexes corresponding to the erased 10+-times recurrent values.

If I have a repitiion of a number, say [2 2 2 2 2] and I reduce it to [2,2,2,2] clearly I have erased one of the 2's. But which one? The first? The last? One of them in the middle?

Alessandro Togni 2021-1-20

编辑：Alessandro Togni 2021-1-20

The 10th, 11th, etc of each list of 10+ occurrences!

Could be useful to say that i have to edit other vector of the same lenght in the same way on the one we're talking about.

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Matt J 2021-1-20

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/722289-sort-a-n-array-for-maximum-number-of-recurring-values-and-storing-the-indexes-corresponding-to-erase#answer_602499

编辑：Matt J 2021-1-20

在 MATLAB Online 中打开

a=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9];
s=diff([inf,a])~=0;
b=ones(size(a));
b(s)=b(s)-[0,diff(find(s))];
discard=(cumsum(b)>10); %indices to discard
a_short=a(~discard) %truncated version of a
a_short = 1×28
     0     0     0     0     0     0     0     0     0     0     2     0     0     0     0     0     5     0     0     0     0     0     0     0     0     0     0     9