Hello! Performing one of the tasks, I got stuck and can not find the best way to solve the problem. I have a table. proc sql;
create table tmp (num int, name char(200));
insert into tmp
values (1,'281.3891.3891.281')
values (2,'3891.281.281.3891')
values (3,'1162.5645.5645.500835.500835.1162')
values (4,'5645.500835.500835.1162.1162.5645')
values (5,'500835.1162.1162.5645.5645.500835')
values (6,'1349.1162.1162.5645.5645.500835.500835.1349')
values (7,'1162.5645.5645.500835.500835.1349.1349.1162')
values (8,'5645.500835.500835.1349.1349.1162.1162.5645')
values (9,'500835.1349.1349.1162.1162.5645.5645.500835');
quit; Each line is a chain, and taking this into account, it is clear that the lines {1;2}, {3;4;5}, {6,7,8,9} are duplicates. The question is, how would it be most correct to filter the rows so that only one row remains inside each of the duplicate groups? (for example the lowest value of the first number like rows 1, 3, 7) I was thinking of creating an array for each row and sorting the values by a common shift within each array. But I'm not sure if this is the smartest way .. THX!
... View more