Check if a string contains only alphabets in Java using Regex

Given a string, the task is to check whether a string contains only alphabets or not using Regex in Java.

Examples:

Input: GeeksforGeeks
Output: True

Input: Geeks4Geeks
Output: False

Input: null
Output: False

In this article, the characters of the string are checked one by one using Regex.

Regular Expressions or Regex is an API for defining String patterns that can be used for searching, manipulating and editing a text. It is widely used to define a constraint on strings such as a password. Regular Expressions are provided under java.util.regex package.

The Regex



^[a-zA-Z]*$

can be used to check a string for alphabets. String.matches() method is used to check whether or not the string matches the given regex.

Algorithm:

  1. Get the string
  2. Match the string with the Regex using matches().
  3. Return true is matched

Pseudocode:

filter_none

edit
close

play_arrow

link
brightness_4
code

public static boolean isStringOnlyAlphabet(String str)
{
    return ((!str.equals(""))
            && (str != null)
            && (str.matches("^[a-zA-Z]*$")));
}

chevron_right






                        filter_none










Below is the implementation of the above approach:


Program: Checking for String containing only Alphabets











                                    filter_none




                                    edit

                                    close




                                    play_arrow




                                    link

                                    brightness_4

                                    code
                                




















// Java program to check if String contains only Alphabets 


// using Regular Expression 


  


class GFG { 


  


    // Function to check String for only Alphabets 


    public static boolean isStringOnlyAlphabet(String str) 


    { 


        return ((str != null) 


                && (!str.equals("")) 


                && (str.matches("^[a-zA-Z]*$"))); 


    } 


  


    // Main method 


    public static void main(String[] args) 


    { 


  


        // Checking for True case 


        System.out.println("Test Case 1:"); 


  


        String str1 = "GeeksforGeeks"; 


        System.out.println("Input: " + str1); 


        System.out.println( 


            "Output: "


            + isStringOnlyAlphabet(str1)); 


  


        // Checking for String with numeric characters 


        System.out.println("\nTest Case 2:"); 


  


        String str2 = "Geeks4Geeks"; 


        System.out.println("Input: " + str2); 


        System.out.println( 


            "Output: "


            + isStringOnlyAlphabet(str2)); 


  


        // Checking for null String 


        System.out.println("\nTest Case 3:"); 


  


        String str3 = null; 


        System.out.println("Input: " + str3); 


        System.out.println( 


            "Output: "


            + isStringOnlyAlphabet(str3)); 


  


        // Checking for empty String 


        System.out.println("\nTest Case 4:"); 


  


        String str4 = ""; 


        System.out.println("Input: " + str4); 


        System.out.println( 


            "Output: "


            + isStringOnlyAlphabet(str4)); 


    } 


} 



















                        chevron_right







                        filter_none









Output:


Test Case 1:
Input: GeeksforGeeks
Output: true

Test Case 2:
Input: Geeks4Geeks
Output: false

Test Case 3:
Input: null
Output: false

Test Case 4:
Input: 
Output: false





Related Articles:





Attention reader! Don’t stop learning now. Get hold of all the important Java and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.





    

        My Personal Notes
        arrow_drop_up
    

    

        
        

            
            
        

    


Recommended Posts:
Code_r
Check out this Author's contributed articles.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on  the "Improve Article" button below.