给定大小为N-1的数组和N个元素的平均值(未给出一个元素)。我们需要找到数组中缺少的值X。 例如:
null
Input : a[] = {2, 4, 20} Mean = 9Output : Missing Element = 10 Explanation : Mean of (2, 4, 20, 10) is(2 + 4 + 20 + 10)/4 = 9
允许 十、 成为缺失的元素 平均值=(a) 1. +a 2. +a 3. ..+X+。。A. N )/N。 所以(a) 1. +a 2. +a 3. ..+X+。。A. N )=Mean*N。 缺失元素x=(平均值*N–(a) 1. +a 2. +a 3. ….A. N ))
C++
// C++ program to find missing element in a // given array from mean. #include <bits/stdc++.h> using namespace std; // Size of a[] is N - 1 (one element missing) int findMissing( int a[], int N, int mean) { // Find sum of array elements int sum = 0; for ( int i = 0; i < N - 1; i++) sum += a[i]; return (mean * N) - sum; } int main() { int a[] = {25, 65, 80}; int mean = 50; int n = sizeof (a)/ sizeof (a[0]); cout << "The missing element : " << findMissing(a, n+1, mean) << endl; return 0; } |
JAVA
// Java program to find missing element // in a given array from mean. import java.io.*; class GFG { // Size of a[] is N - 1 (one element missing) public static int findMissing( int a[], int N, int mean) { // Find sum of array elements int sum = 0 ; for ( int i = 0 ; i < N - 1 ; i++) sum += a[i]; return (mean * N) - sum; } // Driver code public static void main (String[] args) { int a[] = { 25 , 65 , 80 }; int mean = 50 ; int n = a.length; System.out.println( "The missing element : " + findMissing(a, n + 1 , mean)); } } // This code is contributed by upendra bartwal |
Python3
# Python3 code to find missing element # in a given array from mean. # Size of a[] is N - 1 # (one element missing) def findMissing( a , N , mean ): # Find sum of array elements sum = 0 for i in range (N - 1 ): sum + = a[i] return (mean * N) - sum # Driver Code a = [ 25 , 65 , 80 ] mean = 50 n = len (a) print ( "The missing element : " , end = '') print (findMissing(a, n + 1 , mean)) # This code is contributed by Sharad Bhardwaj. |
C#
// C# program to find missing element // in a given array from mean. using System; class GFG { // Size of a[] is N - 1 // (one element missing) public static int findMissing( int [] a, int N, int mean) { // Find sum of array elements int sum = 0; for ( int i = 0; i < N - 1; i++) sum += a[i]; return (mean * N) - sum; } // Driver code public static void Main() { int [] a = { 25, 65, 80 }; int mean = 50; int n = a.Length; Console.WriteLine( "The missing element : " + findMissing(a, n + 1, mean)); } } // This code is contributed by vt_m. |
PHP
<?php // PHP program to find missing // element in a given array // from mean. // Size of a[] is N - 1 // (one element missing) function findMissing( $a , $N , $mean ) { // Find sum of array elements $sum = 0; for ( $i = 0; $i < $N - 1; $i ++) $sum += $a [ $i ]; return ( $mean * $N ) - $sum ; } // Driver Code $a = array (25, 65, 80); $mean = 50; $n = count ( $a ); echo "The missing element : " .findMissing( $a , $n + 1, $mean ); // This code is contributed by Sam007 ?> |
Javascript
<script> // Javascript program to find // missing element in a // given array from mean. // Size of a[] is N - 1 // (one element missing) function findMissing( a, N, mean) { // Find sum of array elements let sum = 0; for (let i = 0; i < N - 1; i++) sum += a[i]; return (mean * N) - sum; } // Driver Code let a = [25, 65, 80]; let mean = 50; let n = a.length; document.write( "The missing element : " + findMissing(a, n+1, mean) + "</br>" ); </script> |
输出:
The missing element : 30
© 版权声明
文章版权归作者所有,未经允许请勿转载。
THE END