|
| 1 | +/* |
| 2 | + * EJERCICIO: |
| 3 | + * Muestra ejemplos de todas las operaciones que puedes realizar con cadenas de caracteres |
| 4 | + * en tu lenguaje. Algunas de esas operaciones podrían ser (busca todas las que puedas): |
| 5 | + * - Acceso a caracteres específicos, subcadenas, longitud, concatenación, repetición, |
| 6 | + * recorrido, conversión a mayúsculas y minúsculas, reemplazo, división, unión, |
| 7 | + * interpolación, verificación... |
| 8 | + * |
| 9 | + * DIFICULTAD EXTRA (opcional): |
| 10 | + * Crea un programa que analice dos palabras diferentes y realice comprobaciones |
| 11 | + * para descubrir si son: |
| 12 | + * - Palíndromos |
| 13 | + * - Anagramas |
| 14 | + * - Isogramas |
| 15 | + */ |
| 16 | + |
| 17 | +const miStr = 'Loki es mi mi perro '; |
| 18 | +console.log(miStr.replace('mi', 'nuestro')); |
| 19 | +console.log(miStr.replaceAll('mi', 'nuestro')); |
| 20 | + |
| 21 | +console.log(miStr.split(' ')); |
| 22 | + |
| 23 | +const trimmed = miStr.trim().length; |
| 24 | + |
| 25 | +console.log(`trimmed tiene length ${trimmed}, sin trimmed ${miStr.length}`); |
| 26 | + |
| 27 | +console.log(miStr.includes('Loki')); |
| 28 | + |
| 29 | +console.log(miStr.concat('inteligente')); |
| 30 | + |
| 31 | +console.log(miStr.toUpperCase()); |
| 32 | + |
| 33 | +console.log(miStr.toLocaleLowerCase()); |
| 34 | + |
| 35 | +console.log(miStr.startsWith('oki', 1)); |
| 36 | + |
| 37 | +console.log(miStr.slice(1, 3)); |
| 38 | + |
| 39 | +console.log(miStr.search('/d')); |
| 40 | + |
| 41 | +console.log(miStr.repeat(2)); |
| 42 | + |
| 43 | +console.log(miStr.padStart(30, 'relleno')); |
| 44 | + |
| 45 | +const isPalindroma = (word) => { |
| 46 | + |
| 47 | + const wordArr = word.split(''); |
| 48 | + const wordArrReverse = word.split('').reverse(); |
| 49 | + |
| 50 | + for (let i = 0; i < wordArr.length; i++) { |
| 51 | + if (wordArr[i] !== wordArrReverse[i]) { |
| 52 | + console.log('no es palindroma'); |
| 53 | + return; |
| 54 | + } |
| 55 | + } |
| 56 | + console.log('es palindroma'); |
| 57 | +} |
| 58 | + |
| 59 | +isPalindroma('oso') |
| 60 | + |
| 61 | +const isAnagrama = (word1, word2) => { |
| 62 | + |
| 63 | + const word1Arr = word1.split('').sort(); |
| 64 | + const word2Arr = word2.split('').sort(); |
| 65 | + |
| 66 | + for (let i = 0; i < word1Arr.length; i++) { |
| 67 | + if (word1Arr[i] !== word2Arr[i]) { |
| 68 | + console.log('no es un anagrama'); |
| 69 | + return; |
| 70 | + } |
| 71 | + } |
| 72 | + |
| 73 | + console.log('es un anagrama'); |
| 74 | +} |
| 75 | + |
| 76 | + |
| 77 | +isAnagrama('roma', 'amor'); |
| 78 | + |
| 79 | +const isIsograma = (word) => { |
| 80 | + |
| 81 | + const set = new Set(); |
| 82 | + |
| 83 | + for (letter in word) { |
| 84 | + if (set.has(letter)) { |
| 85 | + console.log('no es un isograma'); |
| 86 | + return; |
| 87 | + } else { |
| 88 | + set.add(letter); |
| 89 | + } |
| 90 | + } |
| 91 | + |
| 92 | + console.log('es un isograma'); |
| 93 | +} |
| 94 | + |
| 95 | +isIsograma('murcielago'); |
| 96 | + |
0 commit comments