0 votes
by (2 points)
edited

Help Given - line. Write a recursive method that returns a new string in which all the vowels are separated by the symbol & quot; * & quot; with adjacent letters. It is assumed that all the words are composed of letters of the Latin alphabet. String interviewRecursionTest (String line); interviewRecursionTest (& quot; hello & quot;) - & gt; & Quot; h * e * ll * o & quot; interviewRecursionTest (& quot; healo & quot;) - & gt; & Quot; h * e * a * l * o & quot; interviewRecursionTest (& quot; abc & quot;) - & gt; & Quot; a * bc & quot; interviewRecursionTest (& quot; oab & quot;) - & gt; & Quot; o * a * b & quot; Hint please as it is possible to solve this problem, two days I sit I can not think ... I think that maybe there can somehow apply regular expressions, but I can not figure out how to do it rekursiey.Artem Petrenko

13 Answers

0 votes
by (2 points)
edited
After stringbilder with the search symbol in the string and then inserting Stars
0 votes
by (2 points)
edited
Polina, where recursion?
0 votes
by (2 points)
edited
I did not notice that it is needed
0 votes
by (2 points)
edited
Rather, it is a case study and then require MapReduce
0 votes
by (2 points)
edited
Sergey, who are demanding?
0 votes
by (2 points)
edited
For interest decided to carry out this task, it is working as it is written on the subject, if you know the short way to write it, glad to hear))
0 votes
by (2 points)
edited
Hayk, where recursion?
0 votes
by (4 points)
edited
Vadim, Neto, made with the help of cycles. Yes, and I did not know about this pattern))
0 votes
by (2 points)
edited
Vadim, I did not see what was written about recursion))
0 votes
by (2 points)
edited
method for floating stars in the early / late did not write, so as not to clutter
Welcome to askiry.com, where you can ask questions and receive answers from other members of the community.
...