Answer:
I believe it's collaborative software
Explanation:
Answer:
You can simplify the problem down by recognizing that you just need to keep track of the integers you've seen in array that your given. You also need to account for edge cases for when the array is empty or the value you get would be greater than your max allowed value. Finally, you need to ensure O(n) complexity, you can't keep looping for every value you come across. This is where the boolean array comes in handy. See below -
public static int solution(int[] A)
{
int min = 1;
int max = 100000;
boolean[] vals = new boolean[max+1];
if(A.length == 0)
return min;
//mark the vals array with the integers we have seen in the A[]
for(int i = 0; i < A.length; i++)
{
if(A[i] < max + 1)
vals[A[i]] = true;
}
//start at our min val and loop until we come across a value we have not seen in A[]
for (int i = 1; i < max; i++)
{
if(vals[i] && min == i)
min++;
else if(!vals[i])
break;
}
if(min > max)
return max;
return min;
}
<em>A</em><em> </em><em> </em><em>WAn</em><em> </em><em>(</em><em> </em><em>Wide</em><em> </em><em>Area</em><em> </em><em>Network</em><em> </em><em>)</em><em> </em><em>is</em><em> </em><em>made</em><em> </em><em>up</em><em> </em><em>of</em><em> </em><em>LANS</em><em> </em><em>(</em><em> </em><em>Local</em><em> </em><em>Area</em><em> </em><em>Network</em><em>)</em><em>…</em><em>…</em><em>…</em><em>…</em>
