mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 17:50:39 +08:00
re-formate the code
This commit is contained in:
@ -5,38 +5,38 @@
|
||||
* @param {String} str2 second input string
|
||||
* @returns `String` return one alternative arrange string.
|
||||
*/
|
||||
const AlternativeStringArrange = (str1, str2) => {
|
||||
const AlternativeStringArrange = (str1, str2) => {
|
||||
|
||||
// firstly, check that both inputs are strings.
|
||||
if (typeof str1 !== 'string' || typeof str2 !== 'string') {
|
||||
return 'Not string(s)'
|
||||
// firstly, check that both inputs are strings.
|
||||
if (typeof str1 !== 'string' || typeof str2 !== 'string') {
|
||||
return 'Not string(s)'
|
||||
}
|
||||
|
||||
// output string vlaue.
|
||||
let out_str = "";
|
||||
|
||||
// get first string length.
|
||||
const firstStringLength = str1.length;
|
||||
// get second string length.
|
||||
const secondStringLength = str2.length;
|
||||
// absolute length for oparetion.
|
||||
let absLenght = firstStringLength > secondStringLength ? firstStringLength : secondStringLength;
|
||||
|
||||
// Iterate the character count until the absolute count is reached.
|
||||
for (let charCount = 0; charCount < absLenght; charCount++) {
|
||||
// If firstStringLength is lesser than the charCount it means they are able to re-arange.
|
||||
if (charCount < firstStringLength) {
|
||||
out_str += str1[charCount];
|
||||
}
|
||||
|
||||
// output string vlaue.
|
||||
let out_str = "";
|
||||
|
||||
// get first string length.
|
||||
const firstStringLength = str1.length;
|
||||
// get second string length.
|
||||
const secondStringLength = str2.length;
|
||||
// absolute length for oparetion.
|
||||
let absLenght = firstStringLength > secondStringLength ? firstStringLength : secondStringLength;
|
||||
|
||||
// Iterate the character count until the absolute count is reached.
|
||||
for(let charCount = 0; charCount < absLenght; charCount++){
|
||||
// If firstStringLength is lesser than the charCount it means they are able to re-arange.
|
||||
if(charCount < firstStringLength){
|
||||
out_str += str1[charCount];
|
||||
}
|
||||
|
||||
// If secondStringLength is lesser than the charCount it means they are able to re-arange.
|
||||
if(charCount < secondStringLength){
|
||||
out_str += str2[charCount];
|
||||
}
|
||||
// If secondStringLength is lesser than the charCount it means they are able to re-arange.
|
||||
if (charCount < secondStringLength) {
|
||||
out_str += str2[charCount];
|
||||
}
|
||||
}
|
||||
|
||||
// return the output string.
|
||||
return out_str;
|
||||
// return the output string.
|
||||
return out_str;
|
||||
}
|
||||
|
||||
module.exports = AlternativeStringArrange;
|
||||
|
Reference in New Issue
Block a user