String[] array = string.split("[ !,?\\.\\_'@]+");
 S.split("[^A-Za-z]+");

He&&& is a very very good boy, isn't he?

class Solution {
    // Function to reverse words in a given string
    public String reverseWords(String s) {
        // Code here
        s=s.trim();
       // String arr[]=s.split("/s");
       String arr[]=s.split("[ ]+");
       String req="";
       for(int i=arr.length-1;i>=0;i--){
         
           req=req+arr[i]+" ";
       }
       return req.trim();
    }
}
===================================================
import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String s = scan.nextLine();
        s=s.trim();
        if(s.equals("")){
            System.out.println("0");
        }else{
        // Write your code here.
           // String arr[]=s.split("[^A-Za-z]+");
           String arr[]=s.split("[ !,?\\._'@]+");
            System.out.println(arr.length);
            for(String s1:arr){
                System.out.println(s1);
            }
        }
        scan.close();
    }
}

==============================================
import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String s = scan.nextLine();
        s=s.trim();
        if(s.equals("")){
            System.out.println("0");
        }else{
        // Write your code here.
            String arr[]=s.split("[^A-Za-z]+");
            System.out.println(arr.length);
            for(String s1:arr){
                System.out.println(s1);
            }
        }
        scan.close();
    }
}
==================================================
public class Solution {
    public static int makeBeautiful(String str) {
        
       String s1=startsWithOne(str.length());
       String s2=startsWithZero(str.length());
       int diff1=0;
       int diff2=0;

       for(int i=0;i<str.length();i++){
           if(str.charAt(i)!=s1.charAt(i)){
               diff1++;
           }
       }

       for(int i=0;i<str.length();i++){
           if(str.charAt(i)!=s2.charAt(i)){
               diff2++;
           }
       }
       return Math.min(diff1,diff2);
    }

   static String startsWithOne(int n){
        String req="";
       for(int i=0;i<n;i++){
           if(i%2==0){
               req=req+"1";
           }else{
               req=req+"0";
           }
       }
       return req;
    }
   static String startsWithZero(int n){
        String req="";
       for(int i=0;i<n;i++){
           if(i%2==0){
               req=req+"0";
           }else{
               req=req+"1";
           }
       }
       return req;
    }
    //first we will build 2 beautiful strings of same length
    //one start with '1'
    //second starts with '0'
    //after making 2 Strings we will comapre main string with both the String
    //diff1, diff2
}
======================================================================