forked from TheAlgorithms/JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAlternativeStringArrange.js
More file actions
47 lines (39 loc) · 1.5 KB
/
Copy pathAlternativeStringArrange.js
File metadata and controls
47 lines (39 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// Alternative arrange the two given strings in one string in O(n) time complexity.
// Problem Source & Explanation: https://www.geeksforgeeks.org/alternatively-merge-two-strings-in-java/
/**
* Alternative arrange the two given strings in one string in O(n) time complexity.
* @param {String} str1 first input string
* @param {String} str2 second input string
* @returns `String` return one alternative arrange string.
*/
const AlternativeStringArrange = (str1, str2) => {
// firstly, check that both inputs are strings.
if (typeof str1 !== 'string' || typeof str2 !== 'string') {
return 'Not string(s)'
}
// output string value.
let outStr = ''
// get first string length.
const firstStringLength = str1.length
// get second string length.
const secondStringLength = str2.length
// absolute length for operation.
const absLength =
firstStringLength > secondStringLength
? firstStringLength
: secondStringLength
// Iterate the character count until the absolute count is reached.
for (let charCount = 0; charCount < absLength; charCount++) {
// If firstStringLength is lesser than the charCount it means they are able to re-arrange.
if (charCount < firstStringLength) {
outStr += str1[charCount]
}
// If secondStringLength is lesser than the charCount it means they are able to re-arrange.
if (charCount < secondStringLength) {
outStr += str2[charCount]
}
}
// return the output string.
return outStr
}
export { AlternativeStringArrange }