1. PermCheck 桃花顺检验 Check whether array A is a permutation.
2017-02-21 16:31
211 查看
package com.code; import java.util.Arrays; public class Test04_2 { public static int solution(int[] A) { int size = A.length; if(size == 1){ return A[0]==1?1:0; } Arrays.sort(A); for(int i=0;i<size;i++){ if(A[i]!=i+1){ return 0; } } return 1; } public static void main(String[] args) { int [] a = {1,1,3,4}; System.out.println(solution(a)); } } /** 1. PermCheck 桃花顺检验 Check whether array A is a permutation. 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] = 2 is a permutation, but array A such that: A[0] = 4 A[1] = 1 A[2] = 3 is not a permutation, because value 2 is missing. The goal is to check whether array A is a permutation. Write a function: class Solution { public int solution(int[] A); } 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] = 2 the function should return 1. Given array A such that: A[0] = 4 A[1] = 1 A[2] = 3 the function should return 0. Assume that: N is an integer within the range [1..100,000]; each element of array A is an integer within the range [1..1,000,000,000]. Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments). Elements of input arrays can be modified. */
相关文章推荐
- Check whether array A is a permutation.
- 1. PermCheck Check whether array A is a permutation.
- How to judge whether an array is empty?
- Check whether a java instance is belonging to a class
- suse 11 sp4配置yast源报错cannot access installation media(Medium 1),Check whether the server is accessibl
- Geeks - Check whether a given graph is Bipartite or not 二分图检查
- FW - check whether tree is balanced or not - find the max and min of one tree- 2013年12月18日13:12:04
- 判断是否为完全二叉树 Check whether a binary tree is a complete tree or not
- VB.net check whether a file is opened or not
- Adobe--Without using /,% ,+and * operators. write a function to check whether a number is divisible by 3 or nor?
- How to Check Whether Oracle Binary/Instance is RAC Enabled and Relink Oracle Binary in RAC (文档 ID 28
- How To Check Whether Physical Standby is in Sync with the Primary or Not?
- Geeks - Check whether a given graph is Bipartite or not 二分图检查
- Check whether string is interleaved
- Check whether a given Binary Tree is Complete or not 解答
- check whether the crystal report runtime is exists 检查crystalreport运行时是否存在
- leetCode Given an integer (signed 32 bits), write a function to check whether it is a power of 4
- How to Check Whether Oracle Binary/Instance is RAC Enabled and Relink Oracle Binary in RAC (文档 ID 28
- Find whether an array is subset of another array
- How to Check Whether API Server is up or Down