How to resolve the algorithm Determine if a string is collapsible step by step in the R programming language

Published on 12 May 2024 09:40 PM
#R

How to resolve the algorithm Determine if a string is collapsible step by step in the R programming language

Table of Contents

Problem Statement

Determine if a character string is   collapsible. And if so,   collapse the string   (by removing   immediately repeated   characters).

If a character string has   immediately repeated   character(s),   the repeated characters are to be deleted (removed),   but not the primary (1st) character(s).

An   immediately repeated   character is any character that is   immediately   followed by an identical character (or characters).   Another word choice could've been   duplicated character,   but that might have ruled out   (to some readers)   triplicated characters   ···   or more.

{This Rosetta Code task was inspired by a newly introduced   (as of around November 2019)   PL/I   BIF:   collapse.}

In the following character string:

Only the 2nd   t,   e, and   l   are repeated characters,   indicated by underscores (above),   even though they (those characters) appear elsewhere in the character string.

So, after collapsing the string, the result would be:

Another example: In the following character string:

The "collapsed" string would be:

Write a subroutine/function/procedure/routine···   to locate   repeated   characters and   collapse   (delete)   them from the character string.   The character string can be processed from either direction.

Show all output here, on this page:

Use (at least) the following five strings,   all strings are length seventy-two (characters, including blanks),   except the 1st string:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Determine if a string is collapsible step by step in the R programming language

Source code in the r programming language

collapse_string <- function(string){
    
    str_iterable <- strsplit(string, "")[[1]]
    
    message(paste0("Original String: ", "<<<", string, ">>>\n", 
                   "Length: ", length(str_iterable)))
    
    detect <- rep(TRUE, length(str_iterable))
    
    
    for(i in 2:length(str_iterable)){
      
      if(length(str_iterable)==0) break
      
      if(str_iterable[i] == str_iterable[i-1])
        
        detect[i] <- FALSE
    }
    
    collapsed_string <- paste(str_iterable[detect],collapse = "")
    
    message(paste0("Collapsed string: ", "<<<",collapsed_string, ">>>\n",
                   "Length: ", length(str_iterable[detect])), "\n")
    
}

test_strings <- c(
  "",
  "'If I were two-faced, would I be wearing this one?' --- Abraham Lincoln ",
  "..1111111111111111111111111111111111111111111111111111111111111117777888",
  "I never give 'em hell, I just tell the truth, and they think it's hell. ",
  "                                                    --- Harry S Truman  ",
  "The better the 4-wheel drive, the further you'll be from help when ya get stuck!",
  "headmistressship",
  "aardvark",
  "Ciao Mamma, guarda come mi diverto!!"
)

for(test in test_strings){
  collapse_string(test)
}


  

You may also check:How to resolve the algorithm Hello world/Graphical step by step in the Wee Basic programming language
You may also check:How to resolve the algorithm Assertions step by step in the Axe programming language
You may also check:How to resolve the algorithm Visualize a tree step by step in the Fōrmulæ programming language
You may also check:How to resolve the algorithm Factors of an integer step by step in the PL/M programming language
You may also check:How to resolve the algorithm Mandelbrot set step by step in the Ol programming language