How to resolve the algorithm Split a character string based on change of character step by step in the Maple programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Split a character string based on change of character step by step in the Maple programming language

Table of Contents

Problem Statement

Split a (character) string into comma (plus a blank) delimited strings based on a change of character   (left to right). Show the output here   (use the 1st example below).

Blanks should be treated as any other character   (except they are problematic to display clearly).   The same applies to commas.

For instance, the string: should be split and show:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Split a character string based on change of character step by step in the Maple programming language

Source code in the maple programming language

splitChange := proc(str::string)
	local start,i,len;
	start := 1;
	len := StringTools:-Length(str);
	for i from 2 to len do
		if str[i] <> str[start] then
			printf("%s, ",  str[start..i-1]);
			start := i:
		end if;
	end do;
	printf("%s", str[start..len]);
end proc;
splitChange("gHHH5YY++///\\");

  

You may also check:How to resolve the algorithm Nested function step by step in the Python programming language
You may also check:How to resolve the algorithm Ultra useful primes step by step in the Factor programming language
You may also check:How to resolve the algorithm Jacobi symbol step by step in the Scheme programming language
You may also check:How to resolve the algorithm Exponentiation operator step by step in the jq programming language
You may also check:How to resolve the algorithm Hash from two arrays step by step in the Tcl programming language