Codility---PermCheck
Task description
A non-empty zero-indexed array A consisting of N integers is given. A permutation is a sequence containing each element from 1 to N once, and only once. For example, array A such that: A[0] = 4 A[1] = 1 A[2] = 3 A[3] = 2is a permutation, but array A such that: A[0] = 4 A[1] = 1 A[2] = 3is not a permutation, because value 2 is missing. The goal is to check whether array A is a permutation. Write a function:
that, given a zero-indexed array A, returns 1 if array A is a permutation and 0 if it is not. For example, given array A such that: A[0] = 4 A[1] = 1 A[2] = 3 A[3] = 2the function should return 1. Given array A such that: A[0] = 4 A[1] = 1 A[2] = 3the function should return 0. Assume that:
Complexity:
Elements of input arrays can be modified.
Solution
Programming language used: Java
Total time used: 10 minutes
Code: 12:33:43 UTC, java, final, score: 100
|