NoX (CodingBat Solution)

Maybe your like

Home
Upload
Archive
Downloads
Coding Bat
Begineers
ProjectEulter
Guest Post
Forum

Java > Recursion-1 > noX (CodingBat Solution)

Problem:

Given a string, compute recursively a new string where all the 'x' chars have been removed. noX("xaxb") → "ab" noX("abc") → "abc" noX("xx") → ""

Solution:

public String noX(String str) { if (str.equals("")) return str; if (str.charAt(0) == 'x') return noX(str.substring(1)); else return str.charAt(0) + noX(str.substring(1)); }

Labels: codingbat , intermediate , recursion

2 comments :

AnonymousNovember 17, 2017 at 5:36 AM
public String noX(String str) { int i = str.indexOf('x'); if(i==-1)return str; str = str.substring(0,i)+str.substring(i+1); return noX(str);}
ReplyDeleteReplies
UnknownSeptember 16, 2020 at 8:27 PM
public String noX(String str) { if(str.indexOf("x")<0) return str; return noX(str.substring(0, str.indexOf("x")) + str.substring(str.indexOf("x")+1));}
ReplyDeleteReplies

Add commentLoad more... Subscribe to: Post Comments ( Atom )

Search This Site

Follow Me

If you like our content, feel free to follow me to stay updated.

Enter your email address:

We hate spam as much as you do.

Upload Material

Got an exam, project, tutorial video, exercise, solutions, unsolved problem, question, solution manual? We are open to any coding material. Why not upload?

Upload

Tag » Codingbat Nox Solution

Java > Recursion-1 > NoX (CodingBat Solution)