Find first missing positive: Difference between revisions
m
no edit summary
mNo edit summary |
|||
Line 2:
Let given an unsorted integer array '''nums'''. The goal is find the smallest missing positive integer.
<br> '''nums''' = [1,2,0], [3,4,-1,1], [7,8,9,11,12]
=={{header|Julia}}==
<lang julia>
for array in [[1,2,0], [3,4,-1,1], [7,8,9,11,12]]
a = sort(array)
x = findfirst(i -> a[i] > -1 && a[i + 1] - a[i] > 1, 1:length(a)-1)
println("$array => ", x != nothing ? x : a[end] + 1)
end
</lang>{{out}}
<pre>
[1, 2, 0] => 3
[3, 4, -1, 1] => 2
[7, 8, 9, 11, 12] => 3
</pre>
=={{header|Ring}}==
<lang ring>
| |||