A non-empty array A consisting of N numbers is given. The array is sorted in non-decreasing order. The absolute distinct count of this array is the number of distinct absolute values among the elements of the array.
For example, consider array A such that:
A[0] = -5 A[1] = -3 A[2] = -1 A[3] = 0 A[4] = 3 A[5] = 6The absolute distinct count of this array is 5, because there are 5 distinct absolute values among the elements of this array, namely 0, 1, 3, 5 and 6.
Write a function:
class Solution { public int solution(int[] A); }
that, given a non-empty array A consisting of N numbers, returns absolute distinct count of array A.
For example, given array A such that:
A[0] = -5 A[1] = -3 A[2] = -1 A[3] = 0 A[4] = 3 A[5] = 6the function should return 5, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647];
- array A is sorted in non-decreasing order.
using System;
using System.Collections.Generic;
class Solution {
public int solution(int[] A) {
HashSet<int> set = new HashSet<int>();
bool isMinValue = false;
int start = 0;
if (A[0] == int.MinValue)
{
isMinValue = true;
start = 1;
}
for (int i = start; i < A.Length; i++)
{
set.Add(Math.Abs(A[i]));
}
return isMinValue ? set.Count + 1 : set.Count;
}
}
using System;
using System.Collections.Generic;
class Solution {
public int solution(int[] A) {
HashSet<int> set = new HashSet<int>();
bool isMinValue = false;
int start = 0;
if (A[0] == int.MinValue)
{
isMinValue = true;
start = 1;
}
for (int i = start; i < A.Length; i++)
{
set.Add(Math.Abs(A[i]));
}
return isMinValue ? set.Count + 1 : set.Count;
}
}
[-6, -5, 1, 5, 6]
[-2147483648, -1, 1, 2147483647]
using System;
using System.Collections.Generic;
class Solution {
public int solution(int[] A) {
HashSet<int> set = new HashSet<int>();
bool isMinValue = false;
int start = 0;
if (A[0] == int.MinValue)
{
isMinValue = true;
start = 1;
}
for (int i = start; i < A.Length; i++)
{
set.Add(Math.Abs(A[i]));
}
return isMinValue ? set.Count + 1 : set.Count;
}
}
[-6, -5, 1, 5, 6]
[-2147483648, -1, 1, 2147483647]
using System;
using System.Collections.Generic;
class Solution {
public int solution(int[] A) {
HashSet<int> set = new HashSet<int>();
bool isMinValue = false;
int start = 0;
if (A[0] == int.MinValue)
{
isMinValue = true;
start = 1;
}
for (int i = start; i < A.Length; i++)
{
set.Add(Math.Abs(A[i]));
}
return isMinValue ? set.Count + 1 : set.Count;
}
}
The solution obtained perfect score.