Thread Subject:

Remove rows with repeated numbers except for zeros

Hi,
how can i remove rows with repeated digits in A in order to form new_A except for rows where the repeated digit is zero?

A =
     72 81 33
     51 67 28
     33 33 42
     25 48 25
     0 0 98
     
        
new_A =

    72 81 33
    51 67 28
    25 24 0
    0 0 98

In a previous thread Nasser answered with: A(find(arrayfun(@(i)length(unique(A(i,:))),1:size(A,1))==size(A,2)),:)

But this also deletes rows which contain repeated zeros.

Thanks for your help!

Philipp

How did the row
25 48 25
turn into
25 24 0?

"Philipp" wrote in message <iso4re$5mi$1@newscl01ah.mathworks.com>...
> how can i remove rows with repeated digits in A in order to form new_A except for rows where the repeated digit is zero?
>
> A =
> 72 81 33
> 51 67 28
> 33 33 42
> 25 48 25
> 0 0 98
>
> new_A =
> 72 81 33
> 51 67 28
> 25 24 0
> 0 0 98
> ..........
- - - - - - - - - -
  I am going by your words, not your apparently erroneous example:

 t = sort(A,2);
 p = all(diff(t,1,2)~=0|t(:,1:end-1)==0,2);
 new_A = A(p,:);

  Note: With this code if a row has non-zero repeated numbers, it will be deleted even if it also possesses some repeated zeros. I assume that is what you want. Also I assume by 'repeated' you mean to include equal numbers which are not necessarily contiguous in the row.

Roger Stafford

> I am going by your words, not your apparently erroneous example:
>
> t = sort(A,2);
> p = all(diff(t,1,2)~=0|t(:,1:end-1)==0,2);
> new_A = A(p,:);
>
> Note: With this code if a row has non-zero repeated numbers, it will be deleted even if it also possesses some repeated zeros. I assume that is what you want. Also I assume by 'repeated' you mean to include equal numbers which are not necessarily contiguous in the row.
>
> Roger Stafford

Sorry guys for the erroneous example. Of course the row 25 48 25 should be removed and not turn into 25 24 0. My concentration was down after trying solve the problem.

@Roger: Your assumptions are absolutely correct and your code does exactly what I want. I really don't know how you geniuses are able to code the solution of such a problem in only 3 lines.

Thank you very much!

"Philipp " <phil-mayer@web.de> wrote in message
news:isqva8$84s$1@newscl01ah.mathworks.com...

*snip*

> @Roger: Your assumptions are absolutely correct and your code does exactly
> what I want. I really don't know how you geniuses are able to code the
> solution of such a problem in only 3 lines.

Practice, practice, and even more practice.

--
Steve Lord
slord@mathworks.com
To contact Technical Support use the Contact Us link on
http://www.mathworks.com

"Steven_Lord" <slord@mathworks.com> wrote in message <isr0dh$bjg$1@newscl01ah.mathworks.com>...
> "Philipp " <phil-mayer@web.de> wrote in message
> news:isqva8$84s$1@newscl01ah.mathworks.com...
> > @Roger: Your assumptions are absolutely correct and your code does exactly
> > what I want. I really don't know how you geniuses are able to code the
> > solution of such a problem in only 3 lines.
> Practice, practice, and even more practice.
> Steve Lord
- - - - - - - - - -
  Awww, you spoiled it, Steve. Just for a tiny instant there I was a "genius". ;-)

  Actually it could have been squeezed down to just two lines:

 t = sort(A,2);
 new_A = A(all(diff(t,1,2)~=0|t(:,1:end-1)==0,2),:);

but it becomes even harder to decipher.

Roger Stafford