if there are no duplicate attribute values, you can use the second attribute value of each bean as key into a HashMap , and then read it all the way from the second attribute value of b1 from Map .

TreeMap itself is an ordered data structure, which can be sorted in ascending order by default and can be re-saved once. However, whether the storage of a data structure such as List < Bean > is reasonable needs to be considered by yourself.

package github.banana.demo;

import lombok.Data;

import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

public class BeanSort {

    public static void main(String[] args) {
        List<Bean> beans = new ArrayList<>();
        beans.add(new Bean("1111", "test1", "1"));
        beans.add(new Bean("test1", "test2", "2"));
        beans.add(new Bean("test2", "test3", "3"));
        beans.add(new Bean("test5", "test6", "4"));
        beans.add(new Bean("test6", "test7", "5"));
        beans.add(new Bean("test3", "test4", "6"));
        beans.add(new Bean("test4", "test5", "7"));

        Map<String, Bean> map = new TreeMap<>();
        for (Bean b : beans) {
            map.put(b.getTwo(), b);
        }

        for (Map.Entry<String, Bean> entry : map.entrySet()) {
            System.out.println(entry.getKey() + ": " + entry.getValue());
        }
    }
}

@Data
class Bean {
    private String one;
    private String two;
    private String desc;

    Bean(String one, String two, String desc) {
        this.one = one;
        this.two = two;
        this.desc = desc;
    }
}