查找最长且包含最低可能数字的字符串的算法？

Question

I have to find string out of these which is longest and contains the lowest possible numbers.

1. 10,20
2. 10,20,30
3. 10,30,40
4. 30,40,50

Ans 10,20,30

I am trying to think of algorithm which can be used to find such record.

Record will not contain duplicate number for example e.g 10,10,20 won't be case.

Answer 1

Based on clarification of requirements:

• split strings by delimiters and convert to lists of (unique) numbers
• determine the max # of elements, M, in any list
• get the set of lists with M elements
• for each list, find the min element
• pick the list with the lowest min

Answer 2

There is a general solution for problems where you need to find a string out of a collection of strings.

In case your data can be sorted then use a PriorityQueue .

From the docs:

An unbounded priority queue based on a priority heap. The elements of the priority queue are ordered according to their natural ordering, or by a Comparator

    PriorityQueue<String> a = new PriorityQueue<>((o1, o2) -> {
        int compare = Integer.compare(o1.length(), o2.length());
        if(compare != 0){
            return compare;
        }
        
        int result = compare numbers...

        return result;
    });

    a.add("10,20");
    a.add("10,20,30");
    a.add("10,30,40");
    a.add("30,40,50");

    System.out.println(a.remove()); // 10,20,30

In case it's not, use any List and do the filtering one by one.