Common sorted list: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: added a REXX stub.) |
m (added whitespace.) |
||
Line 2: | Line 2: | ||
Given an integer array '''nums''', the goal is create common sorted list with unique elements. |
Given an integer array '''nums''', the goal is create common sorted list with unique elements. |
||
For example: |
|||
;Example: |
|||
<br> '''nums''' = [5,1,3,8,9,4,8,7], [3,5,9,8,4], [1,3,7,9] |
<br> '''nums''' = [5,1,3,8,9,4,8,7], [3,5,9,8,4], [1,3,7,9] |
||
<br> '''output''' = [1,3,4,5,7,8,9] |
<br> '''output''' = [1,3,4,5,7,8,9] |
||
<br><br> |
|||
=={{header|REXX}}== |
=={{header|REXX}}== |
Revision as of 10:02, 24 February 2021
Common sorted list is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
Given an integer array nums, the goal is create common sorted list with unique elements.
- Example
nums = [5,1,3,8,9,4,8,7], [3,5,9,8,4], [1,3,7,9]
output = [1,3,4,5,7,8,9]
REXX
<lang rexx>
Ring
<lang ring> nums = [[5,1,3,8,9,4,8,7],[3,5,9,8,4],[1,3,7,9]] sumNums = []
for n = 1 to len(nums)
for m = 1 to len(nums[n]) add(sumNums,nums[n][m]) next
next
sumNums = sort(sumNums) for n = len(sumNums) to 2 step -1
if sumNums[n] = sumNums[n-1] del(sumNums,n) ok
next
sumNums = sort(sumNums)
see "common sorted list elements are: " showArray(sumNums)
func showArray(array)
txt = "" see "[" for n = 1 to len(array) txt = txt + array[n] + "," next txt = left(txt,len(txt)-1) txt = txt + "]" see txt
</lang>
- Output:
common sorted list elements are: [1,3,4,5,7,8,9]