left

Language: Java $8$

Language: Java $8$

$5.$ Question $5$

Problem Description

Given a string s consisting of words separated by spaces, where each word contains an integer representing its correct position in the sorted string. Your goal is to sort the string by moving each word to its correct position while removing the integer $x$ from each word.

$\backslash$table$[[1,],[25,$import java.$],[26,$class Sortst$],[27,$public$],[28,],[29,\}],[30,\}],[31,],[32,>$ public cla$]]$

$2-$ For example, the string $s="2$ a ni$3$ce hav$1$e evening$4"$ will become "have a nice evening"

$3,$ Rules

the resulting output words in s each consist of at least one lowercase or

$4$

uppercase English letters.

$-$each word in s contains exactly one non$-$negative integer.

$5$

no two words in s has the same integer.

integers found in all words aren't necessarily consecutive. A word $x$

$6$ preceeds another word $y$ if the integer in $x$ is less than the integer in $y.$

$s$ has a length of at least $2$ words.

$7$

the words in s are separated by a single space.

s contains no leading or trailing spaces.

$8$

Type here to search