String replace() method in Java with Examples
Last Updated :
16 Feb, 2024
The String replace() method returns a new string after replacing all the old characters/CharSequence with a given character/CharSequence.
Example:
Return a new string where all " o" characters are replaced with "p" character:
Java
// Java program to demonstrate
// the replace() method
public class Main {
public static void main(String[] args) {
// Define an original string
String originalString = "Hello World";
// Replace 'o' with 'p' in the original string
String replacedString = originalString.replace("o", "p");
// Print the replaced string
System.out.println(replacedString);
}
}
Syntax
public String replace(char oldch, char newch)
Parameters
- oldch: the old character.
- newch: the new character.
Return Value
- It returns a string derived from this string by replacing every occurrence of oldch with newch.
Exception
- NullPointerException- replace() method returns this exception when the target char/CharSequence is null.
Java String replace() Examples
The following examples demonstrate how to use the replace() method in Java:Â
Example 1: Java String replace(char old, char new) Method
To show the working of replace(char old, char new).
Java
// Java code to demonstrate the
// working of replace()
public class rep1 {
public static void main(String args[])
{
// Initialising String
String Str = new String("Welcome to geeksforgeeks");
// Using replace to replace characters
System.out.print("After replacing all o with T : ");
System.out.println(Str.replace('o', 'T'));
// Using replace to replace characters
System.out.print("After replacing all e with D : ");
System.out.println(Str.replace('e', 'D'));
}
}
OutputAfter replacing all o with T : WelcTme tT geeksfTrgeeks
After replacing all e with D : WDlcomD to gDDksforgDDks
Example 2: Java String replace(String target, String replacement) Method
We can implement the replace() method with substring/CharSequence just like with char.
To show the working of the replace(String target, String replacement) method.
Java
// Java Program to implement
// replace() method
import java.io.*;
class GFG {
public static void main(String[] args)
{
String s1 = "GeeksforGeeks";
// orignal string
System.out.println(s1);
// Replace Geeks with Gfg
String replaceString = s1.replace("Geeks", "GfG ");
// New String
System.out.println(replaceString);
}
}
OutputGeeksforGeeks
GfG forGfG
Example 3:
The null regular expression is not accepted by the replace() method, it raises the NullPointerException.
Java
// Java Program to implement
// Java replaceAll() method
import java.io.*;
// Driver Class
class GFG {
// Main function
public static void main(String[] args)
{
String str = "GeeksforGeeks";
int size = str.length();
System.out.println(str);
String target = null;
// replacing null with GFG
str = str.replace(target, "GFG");
System.out.println(str);
}
}
Output
Exception in thread "main" java.lang.NullPointerException
at java.base/java.lang.String.replace(String.java:2142)
at GFG.main(GFG.java:12)
String replace() Method - Java Programs
Let's see some coding problems and solve them with the String charAt() method in Java.
1. Replace Substrings in a String Using the replace() Java method
Java
public class WordReplacement {
public static void main(String[] args) {
String sentence = "We are learning JavaScript";
String wordToReplace = "JavaScript";
String replacementWord = "Java";
System.out.println("Original sentence: " + sentence);
String replacedSentence = replaceWord(sentence, wordToReplace, replacementWord);
System.out.println("Replaced sentence: " + replacedSentence);
}
// Method to replace all occurrences of a word in a sentence
private static String replaceWord(String sentence, String wordToReplace, String replacementWord) {
// Use replaceAll() method to replace all occurrences
return sentence.replaceAll("\\b" + wordToReplace + "\\b", replacementWord);
}
}
OutputOriginal sentence: We are learning JavaScript
Replaced sentence: We are learning Java
2. Replace Spaces with Underscores Using the replace() Java method
Java
public class ReplaceSpacesExample {
public static void main(String[] args) {
String sentence = "Geeks for Geeks";
String replacedSentence = replaceSpaces(sentence);
System.out.println("Replaced sentence: " + replacedSentence);
}
// Method to replace spaces with underscores
private static String replaceSpaces(String sentence) {
return sentence.replace(" ", "_");
}
}
OutputReplaced sentence: Geeks_for_Geeks
References
To know more about more String Methods refer to the article Java String Methods
Whether you are a beginner starting Java programming or an experienced looking to brush up on your Java skills, this tutorial will provide you with a deep understanding of the replace function and its uses in Java.
The charAt method in Java is a fundamental function for string manipulation. With this guide, you can easily access the characters of a string using the replace function.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Java Tutorial Java is a high-level, object-oriented programming language used to build web apps, mobile applications, and enterprise software systems. It is known for its Write Once, Run Anywhere capability, which means code written in Java can run on any device that supports the Java Virtual Machine (JVM).Java s
10 min read
Java Interview Questions and Answers Java is one of the most popular programming languages in the world, known for its versatility, portability, and wide range of applications. Java is the most used language in top companies such as Uber, Airbnb, Google, Netflix, Instagram, Spotify, Amazon, and many more because of its features and per
15+ min read
Java OOP(Object Oriented Programming) Concepts Java Object-Oriented Programming (OOPs) is a fundamental concept in Java that every developer must understand. It allows developers to structure code using classes and objects, making it more modular, reusable, and scalable.The core idea of OOPs is to bind data and the functions that operate on it,
13 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read