检查所有数组元素是否不同

给定一个数组,检查数组中的所有元素是否不同。 例如:

null
Input : 1, 3, 2, 4Output : YesInput : "Geeks", "for", "Geeks"Output : NoInput : "All", "Not", "Equal"Output : Yes

简单解决方案 就是使用两个嵌套循环。对于每个元素,检查它是否重复。如果有任何元素重复,则返回false。如果没有元素重复,则返回false。 一 有效解决方案 就是散列。我们把所有数组元素放在一个 哈希集 .如果哈希集的大小与数组大小相同,则返回true。

C++

// C++ program to check if all array
// elements are distinct
#include <bits/stdc++.h>
using namespace std;
bool areDistinct(vector< int > arr)
{
int n = arr.size();
// Put all array elements in a map
unordered_set< int > s;
for ( int i = 0; i < n; i++) {
s.insert(arr[i]);
}
// If all elements are distinct, size of
// set should be same array.
return (s.size() == arr.size());
}
// Driver code
int main()
{
std::vector< int > arr = { 1, 2, 3, 2 };
if (areDistinct(arr)) {
cout << "All Elements are Distinct" ;
}
else {
cout << "Not all Elements are Distinct" ;
}
return 0;
}


JAVA

// Java program to check if all array elements are
// distinct or not.
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class DistinctElements {
public static boolean areDistinct(Integer arr[])
{
// Put all array elements in a HashSet
Set<Integer> s =
new HashSet<Integer>(Arrays.asList(arr));
// If all elements are distinct, size of
// HashSet should be same array.
return (s.size() == arr.length);
}
// Driver code
public static void main(String[] args)
{
Integer[] arr = { 1 , 2 , 3 , 2 };
if (areDistinct(arr))
System.out.println( "All Elements are Distinct" );
else
System.out.println( "Not all Elements are Distinct" );
}
}


Python3

# Python3 program to check if all array
# elements are distinct
def areDistinct(arr) :
n = len (arr)
# Put all array elements in a map
s = set ()
for i in range ( 0 , n):
s.add(arr[i])
# If all elements are distinct,
# size of set should be same array.
return ( len (s) = = len (arr))
# Driver code
arr = [ 1 , 2 , 3 , 2 ]
if (areDistinct(arr)):
print ( "All Elements are Distinct" )
else :
print ( "Not all Elements are Distinct" )
# This code is contributed by ihritik


C#

// C# program to check if all array elements are
// distinct or not.
using System;
using System.Collections.Generic;
public class DistinctElements
{
public static bool areDistinct( int []arr)
{
// Put all array elements in a HashSet
HashSet< int > s = new HashSet< int >(arr);
// If all elements are distinct, size of
// HashSet should be same array.
return (s.Count == arr.Length);
}
// Driver code
public static void Main(String[] args)
{
int [] arr = { 1, 2, 3, 2 };
if (areDistinct(arr))
Console.WriteLine( "All Elements are Distinct" );
else
Console.WriteLine( "Not all Elements are Distinct" );
}
}
// This code has been contributed by 29AjayKumar


Javascript

<script>
// Javascript program to check if all array
// elements are distinct
function areDistinct(arr)
{
let n = arr.length;
// Put all array elements in a map
let s = new Set();
for (let i = 0; i < n; i++) {
s.add(arr[i]);
}
// If all elements are distinct, size of
// set should be same array.
return (s.size == arr.length);
}
// Driver code
let arr = [ 1, 2, 3, 2 ];
if (areDistinct(arr)) {
document.write( "All Elements are Distinct" );
}
else {
document.write( "Not all Elements are Distinct" );
}
// This code is contributed
// by _saurabh_jaiswal
</script>


输出:

Not all Elements are Distinct

© 版权声明
THE END
喜欢就支持一下吧
点赞15 分享