Write a recursive function ‘public static String replace(String str,char from,char to) ‘ that changes all occurrences of ‘from’ in ‘str’ to ‘to’.
For example, if str were “codebook”, and from = ‘o’ and to = ‘e’, then, str would become “cedebeek”.
Function Definitions:
public static String replace(String str, char from, char to)
Problem Requirements:
Keyword
Min Count
Max Count
for
0
0
while
0
0
Note: Create the main() inside the class ‘ReplaceDriver’
Refer sample input and output for formatting specifications.
Sample Input and Output :
Enter the string
Asia
Enter the character to be replaced
a
Enter the character to be replaced with
i
The modified string is Asii
CODE:–
ReplaceDriver.java
import java.util.Scanner;
public class ReplaceDriver{
public static String replace(String str, char c1, char c2){
if(str.length()<1){
return str;
}
else{
char first=c1==str.charAt(0)? c2 :str.charAt(0);
return first+ replace(str.substring(1),c1,c2);
}
}
public static void main(String[] args)
{
Scanner r= new Scanner(System.in);
String str= new String();
System.out.println("Enter the string");
str=r.nextLine();
System.out.println("Enter the character to be replaced");
char c1= r.next().charAt(0);
System.out.println("Enter the character to be replaced with");
char c2=r.next().charAt(0);
System.out.print("The modified string is "+ replace(str,c1,c2));
}
}
Tags:
binary tree | linear data structure | data structures in c | data structure | heap sort | abdul bari udemy data structures udemy | coding ninjas data structures | binary tree example | data structure and algorithmic thinking with python | queue geeksforgeeks | data structures in c programming
ConversionConversion EmoticonEmoticon