Cifre una string en el Rovarspraket (El lenguaje de los ladrones)

Dada una string, la tarea es escribir una función translate() que traducirá un texto a » rovarspraket » (sueco para «lenguaje de ladrones»). Es decir, duplica cada consonante y coloca una «o» en el medio. 

Ejemplos: 

Input : this is fun
Output : tothohisos isos fofunon
t is consonant then double the consonant and place "o" in between, 
So it becomes "tot" and do this for full string

Input : geeks
Output : gogeekoksos

Implementación:

// C++ implementation to Encrypt a
// string into the rovarspraket (Robber Language)
#include<iostream>
using namespace std;
 
// Function return translated string
string translate(string a)
{
    // Length of the string
    int len = a.length();
    string res="";
     
// Run till length of string
    for(int i=0; i<len ;i++)
    {
        // checking if character is vowel,
        // if yes then append it as it is
        if (a[i] == 'a' || a[i]== 'e' || a[i] == 'i' || a[i] == 'o' || a[i] == 'u')
        {
            res = res + a[i];
        }
         
        // if space then append as it is
        else if(a[i] == ' ')
        {
            res = res +a[i];
        }
         
        // else double the consonant and put o in between
        else
        {
            res =res+ a[i] + 'o' + a[i];
        }
    }
     
    // return translated string
    return res;
}
 
// Driver Code
int main()
{
    string str = "geeks for geeks";
     
    // Calling function
    cout << translate(str) << endl;
    return 0;
}

// Java implementation to Encrypt a
// String into the rovarspraket (Robber Language)
import java.util.*;
 
class GFG
{
 
// Function return translated String
static String translate(String a)
{
    // Length of the String
    int len = a.length();
    String res = "";
     
    // Run till length of String
    for(int i = 0; i < len; i++)
    {
        // checking if character is vowel,
        // if yes then append it as it is
        if (a.charAt(i) == 'a' || a.charAt(i)== 'e' ||
            a.charAt(i) == 'i' || a.charAt(i) == 'o' ||
            a.charAt(i) == 'u')
        {
            res = res + a.charAt(i);
        }
         
        // if space then append as it is
        else if(a.charAt(i) == ' ')
        {
            res = res +a.charAt(i);
        }
         
        // else double the consonant and
        // put o in between
        else
        {
            res = res + a.charAt(i) + 'o' + a.charAt(i);
        }
    }
     
    // return translated String
    return res;
}
 
// Driver Code
public static void main(String[] args)
{
    String str = "geeks for geeks";
     
    // Calling function
    System.out.println(translate(str));
}
}
 
// This code is contributed by PrinciRaj1992

# Python implementation to Encrypt a
# string into the rovarspraket (Robber Language)
 
def translate(a):
    c=0
    x = ""
     
    # Count length of string
    for i in a:
        c+=1
    for i in range (0, c):
        # If alphabet is vowel, do not change
        if a[i] == 'a' or a[i]== 'e' or a[i] == 'i' or a[i] == 'o' or a[i] == 'u':
            b = a[i]
            x += b
             
        # else double the consonant and put 'O' in between the alphabet
        else if a[i]!=" ":
            b = a[i] +'o' + a[i]
            x += b
             
        # if string has space than put space
        else if a[i] == " ":
            x +=a[i]
     
    # print string
    print(x)
     
s = "geeks for geeks"
translate(s)

// C# implementation to Encrypt a
// String into the rovarspraket (Robber Language)
using System;
     
class GFG
{
 
// Function return translated String
static String translate(String a)
{
    // Length of the String
    int len = a.Length;
    String res = "";
     
    // Run till length of String
    for(int i=0; i<len ;i++)
    {
        // checking if character is vowel,
        // if yes then append it as it is
        if (a[i] == 'a' || a[i]== 'e' ||
            a[i] == 'i' || a[i] == 'o' || a[i] == 'u')
        {
            res = res + a[i];
        }
         
        // if space then append as it is
        else if(a[i] == ' ')
        {
            res = res + a[i];
        }
         
        // else double the consonant and put o in between
        else
        {
            res = res + a[i] + 'o' + a[i];
        }
    }
     
    // return translated string
    return res;
}
 
// Driver Code
public static void Main(String[] args)
{
    String str = "geeks for geeks";
     
    // Calling function
    Console.WriteLine(translate(str));
}
}
 
// This code is contributed by PrinciRaj1992

<script>
 
// JavaScript implementation to Encrypt a
// string into the rovarspraket (Robber Language)
 
// Function return translated string
function translate(a)
{
    // Length of the string
    let len = a.length;
    let res="";
     
    // Run till length of string
    for(let i=0; i<len ;i++)
    {
        // checking if character is vowel,
        // if yes then append it as it is
        if (a[i] == 'a' || a[i]== 'e' || a[i] == 'i' || a[i] == 'o' || a[i] == 'u')
        {
            res = res + a[i];
        }
         
        // if space then append as it is
        else if(a[i] == ' ')
        {
            res = res +a[i];
        }
         
        // else double the consonant and put o in between
        else
        {
            res =res+ a[i] + 'o' + a[i];
        }
    }
     
    // return translated string
    return res;
}
 
// Driver Code
 
let str = "geeks for geeks";
 
// Calling function
document.write(translate(str),"</br>");
 
// This code is contributed by shinjanpatra
 
</script>

gogeekoksos foforor gogeekoksos

Este artículo es una contribución de Sahil Rajput . Si te gusta GeeksforGeeks y te gustaría contribuir, también puedes escribir un artículo usando write.geeksforgeeks.org o enviar tu artículo por correo a review-team@geeksforgeeks.org. Vea su artículo que aparece en la página principal de GeeksforGeeks y ayude a otros Geeks.