split(CharSequence, int) method of a Pattern class used to splits the given char sequence passed as parameter to method around matches of this pattern.The array returned contains each substring of the input sequence created by this method. The substrings in the array are in the order in which they occur in the input. If this pattern does not match any subsequence of the input then the resulting array has just one element, namely the input sequence in string form. The limit parameter passed as int help to calculate the number of times the pattern is applied and affects the length of the resulting array. If the limit n is greater than zero then the pattern will be applied at most n – 1 time. If n is non-positive or Zero then the pattern will be applied as many times as possible.
Syntax:
public String[] split?(CharSequence input, int limit)
Parameters: This method accepts two parameter one input which represents character sequence to be split and other limit which represents The result threshold as mentioned in description.
Return value: This method returns the array of strings computed by splitting the input around matches of this pattern.
Below programs illustrate the split(CharSequence, int) method:
Program 1:
// Java program to demonstrate// Pattern.split(CharSequence) method import java.util.regex.*; public class GFG { public static void main(String[] args) { // create a REGEX String String REGEX = "geeks"; // create the string // in which you want to search String actualString = "Welcome to geeks for geeks"; // create a Pattern using REGEX Pattern pattern = Pattern.compile(REGEX); // create limit to 2 // so it can applied at most limit - 1 time int limit = 2; // split the text String[] array = pattern.split(actualString, limit); // print array for (int i = 0; i < array.length; i++) { System.out.println("array[" + i + "]=" + array[i]); } }} |
array[0]=Welcome to array[1]= for geeks
Program 2:
// Java program to demonstrate// Pattern.split(CharSequence) method import java.util.regex.*; public class GFG { public static void main(String[] args) { // create a REGEX String String REGEX = "ee"; // create the string // in which you want to search String actualString = "aaeebbeecceeddee"; // create a Pattern using REGEX Pattern pattern = Pattern.compile(REGEX); // create limit to 2 // so it can applied at most limit - 1 time int limit = 0; // split the text String[] array = pattern.split(actualString, limit); // print array for (int i = 0; i < array.length; i++) { System.out.println("array[" + i + "]=" + array[i]); } }} |
array[0]=aa array[1]=bb array[2]=cc array[3]=dd
