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

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Determine if a string is collapsible step by step in the APL 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 APL programming language

Source code in the apl programming language

task{
   ⍝ Collapse a string
   collapse{(1,¯11)/}

   ⍝ Given a function ⍺⍺, display a string in brackets,
   ⍝ along with its length, and do the same for the result
   ⍝ of applying ⍺⍺ to the string.
   display{
      bracket{(),' «««',,'»»»'}
      (bracket ),(bracket  )
   }

   ⍝ Strings from the task
   s1''
   s2'"If I were two-faced, would I be wearing this one?"'
   s2,' --- Abraham Lincoln '
   s3'..1111111111111111111111111111111111111111111111111'
   s3,'111111111111117777888'
   s4'I never give ''em hell, I just tell the truth, '
   s4,'and they think it''s hell. '
   s5'                                             '
   s5,'       --- Harry S Truman  '
   strss1 s2 s3 s4 s5

   ⍝ Collapse each string and display it as specified
   collapse display¨ strs
}


  

You may also check:How to resolve the algorithm Middle three digits step by step in the C++ programming language
You may also check:How to resolve the algorithm Pythagorean triples step by step in the XPL0 programming language
You may also check:How to resolve the algorithm Show the epoch step by step in the jq programming language
You may also check:How to resolve the algorithm Averages/Root mean square step by step in the SparForte programming language
You may also check:How to resolve the algorithm Fibonacci n-step number sequences step by step in the Ruby programming language