Task description
Write a function
Assume that:
A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3.
Complexity:
class Solution { public int solution(int[] A) { // write your code in Java SE 8 int len=A.length; int count=1; int tmp=0; for(int i=0;i<len;i++){ for(int j=i+1;j<len;j++){ if(A[i]>A[j]){ tmp=A[i]; A[i]=A[j]; A[j]=tmp; } } } for(int i=0;i<len-1;i++){ if(A[i]!=A[i+1])count++; } if(len==0) count=0; return count; } }
75% 75 out of 100 points
Analysis
that, given a zero-indexed array A consisting of N integers, returns the number of distinct values in array A.class Solution { public int solution(int[] A); }
Assume that:
For example, given array A consisting of six elements such that:
- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−1,000,000..1,000,000].
A[0] = 2 A[1] = 1 A[2] = 1 A[3] = 2 A[4] = 3 A[5] = 1the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3.
Complexity:
Elements of input arrays can be modified.
- expected worst-case time complexity is O(N*log(N));
- expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
class Solution { public int solution(int[] A) { // write your code in Java SE 8 int len=A.length; int count=1; int tmp=0; for(int i=0;i<len;i++){ for(int j=i+1;j<len;j++){ if(A[i]>A[j]){ tmp=A[i]; A[i]=A[j]; A[j]=tmp; } } } for(int i=0;i<len-1;i++){ if(A[i]!=A[i+1])count++; } if(len==0) count=0; return count; } }
75% 75 out of 100 points
Analysis summary
The following issues have been detected: timeout errors.
Detected time complexity:
O(N**2)
O(N**2)
expand allExample tests
expand allCorrectness tests
expand allPerformance tests
large1
chaotic sequence of values from [0..100K], length=10K
chaotic sequence of values from [0..100K], length=10K
TIMEOUT ERROR
running time: 2.67 sec., time limit: 2.41 sec.
running time: 2.67 sec., time limit: 2.41 sec.
large_random1
chaotic sequence of values from [-1M..1M], length=100K
chaotic sequence of values from [-1M..1M], length=100K
TIMEOUT ERROR
running time: >9.00 sec., time limit: 3.61 sec.
running time: >9.00 sec., time limit: 3.61 sec.
large_random2
another chaotic sequence of values from [-1M..1M], length=100K
another chaotic sequence of values from [-1M..1M], length=100K
TIMEOUT ERROR
running time: >9.00 sec., time limit: 3.59 sec.
running time: >9.00 sec., time limit: 3.59 sec.
I have added a code that got 100 % on codility.
ReplyDeletefunction solution($A) {
// write your code in PHP7.0
$A=array_unique($A);
return count($A);
exit(1);
}
https://app.codility.com/demo/results/trainingAJVQCH-PRQ/