Skip to main content

Sort List of Object property in Java with check null values

Sort java List by Object property with null check using Comparator

Sort ArrayList of custom Objects by property with null values

Example 1 :- Sorting a list without null check using Comparator inline anonymous class

Programming.java

public class Programming {

    private int id;
    private String language;

    public Programming(int id, String language) {
        this.id = id;
        this.language = language;
    }
    
    public int getId() {
        return id;
    }
    public void setId(int id) {
        this.id = id;
    }
    public String getLanguage() {
        return language;
    }
    public void setLanguage(String language) {
        this.language = language;
    }
    
    @Override
    public String toString() {
        return "Programming [id=" + id + ", language=" + language + "]";
    }
}

ComparatorDemo.java


import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class ComparatorDemo {

    public static void main(String[] args) {
        
        List<Programming> programmingList = new ArrayList<>() {{
            add(new Programming(1, "Java"));
            add(new Programming(2, "Python"));
            add(new Programming(3, "CSharp"));
            add(new Programming(4, "JavaScript"));
            add(new Programming(4, "C"));
            add(new Programming(4, "Dot net"));
            add(new Programming(4, "C++"));
            add(new Programming(4, "Go"));
            add(new Programming(4, "Php"));
        }};
        
        Collections.sort(programmingList, new Comparator<Programming>() {
            @Override
            public int compare(Programming o1, Programming o2) {
                return o1.getLanguage().compareTo(o2.getLanguage());
            }
        });
        
        programmingList.stream().forEach(programming ->
                System.out.println(programming));
        
    }

Output :-

Programming [id=11, language=AngularJs]
Programming [id=5, language=C]
Programming [id=7, language=C++]
Programming [id=3, language=CSharp]
Programming [id=6, language=Dot net]
Programming [id=8, language=Go]
Programming [id=1, language=Java]
Programming [id=4, language=JavaScript]
Programming [id=9, language=Php]
Programming [id=2, language=Python]
Programming [id=10, language=ReactJs]
Programming [id=12, language=VueJs]

Example 2 :- Sort java list using Java 8 lambdas

Collections.sort(programmingList,
                (o1, o2) -> o1.getLanguage().compareTo(o2.getLanguage()));

Example 3 :- Sort java list with null checking

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class ComparatorDemo {

    public static void main(String[] args) {
        
        List<Programming> programmingList = new ArrayList<>() {{
            add(new Programming(1, "Java"));
            add(new Programming(2, "Python"));
            add(new Programming(3, "CSharp"));
            add(new Programming(4, "JavaScript"));
            add(new Programming(5, "C"));
            add(new Programming(6, "Dot net"));
            add(new Programming(7, "C++"));
            add(new Programming(8, "Go"));
            add(new Programming(9, "Php"));
            add(new Programming(10, "ReactJs"));
            add(new Programming(11, "AngularJs"));
            add(new Programming(12, "VueJs"));
            add(new Programming(13, null));
            add(new Programming(14, null));
        }};
        
        Collections.sort(programmingList, new Comparator<Programming>() {
            @Override
            public int compare(Programming o1, Programming o2) {
                if (o1.getLanguage() == null) {
                    return (o2.getLanguage() == null) ? 0 : -1;
                }
                if (o2.getLanguage() == null) {
                    return 1;
                }
                return o2.getLanguage().compareTo(o1.getLanguage());
            }
        });
        
        programmingList.stream().forEach(programming ->
                    System.out.println(programming));
    }

}

Output :-

Programming [id=13, language=null]
Programming [id=14, language=null]
Programming [id=11, language=AngularJs]
Programming [id=5, language=C]
Programming [id=7, language=C++]
Programming [id=3, language=CSharp]
Programming [id=6, language=Dot net]
Programming [id=8, language=Go]
Programming [id=1, language=Java]
Programming [id=4, language=JavaScript]
Programming [id=9, language=Php]
Programming [id=2, language=Python]
Programming [id=10, language=ReactJs]
Programming [id=12, language=VueJs]

You can see null values are print first and then all other are sorted based on name. If you want to print null values as last then change code as below.

Change -1 to 0 and 0 to -1 

Collections.sort(programmingList, new Comparator<Programming>() {
    @Override
    public int compare(Programming o1, Programming o2) {
        if (o1.getLanguage() == null) {
            return (o2.getLanguage() == null) ? -1 : 0;
        }
        if (o2.getLanguage() == null) {
            return 1;
        }
        return o1.getLanguage().compareTo(o2.getLanguage());
    }
});

Now let's see how to Reverse Sort java list.

Example 4 :- Reverse Sort java list of object by its property with Null check

We can reverse java list by simply put '-' sign as following.

Collections.sort(programmingList, new Comparator<Programming>() {
    @Override
    public int compare(Programming o1, Programming o2) {
        if (o1.getLanguage() == null) {
            return (o2.getLanguage() == null) ? -1 : 0;
        }
        if (o2.getLanguage() == null) {
            return 1;
        }
        return -o1.getLanguage().compareTo(o2.getLanguage());
    }
});


Comments

Popular posts from this blog

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...