Write a Java program to swap every two adjacent nodes of a given linked list

import java.util.*;
public class Solution {  
 public static void main(String[] args) {
        String str1 = "The length of last word";
		System.out.println("Original String: "+str1);
        System.out.println("Length of the last word of the above string: "+length_Of_last_word(str1));
    }

    public static int length_Of_last_word(String str1) {
        int length_word = 0;
        String[] words = str1.split(" ");
        if(words.length>0) {
            length_word = words[words.length-1].length();			
        } else {
            length_word = 0;
        }
        return length_word;
    }
}

Sample Output:

Original String: The length of last word
Length of the last word of the above string: 4