Encuentre la proporción de ceros, números positivos y números negativos en la array

Dada una array a de números enteros de tamaño N enteros, la tarea es encontrar la proporción de números positivos, números negativos y ceros en la array hasta cuatro lugares decimales.

Ejemplos: 

Entrada: a[] = {2, -1, 5, 6, 0, -3} 
Salida: 0,5000 0,3333 0,1667 
Hay 3 positivos, 2 negativos y 1 cero. Su relación sería positiva: 3/6 = 0,5000, negativa: 2/6 = 0,3333 y cero: 1/6 = 0,1667.

Entrada: a[] = {4, 0, -2, -9, -7, 1} 
Salida: 0,3333 0,5000 0,1667 
Hay 2 positivos, 3 negativos y 1 cero. Su relación sería positiva: 2/6 = 0,3333, negativa: 3/6 = 0,5000 y cero: 1/6 = 0,1667. 

Acercarse:  

  1. Cuente el número total de elementos positivos en la array.
  2. Cuente el número total de elementos negativos en la array.
  3. Cuente el número total de elementos cero en la array.
  4. Divida el número total de elementos positivos, elementos negativos y cero elementos por el tamaño de la array para obtener la proporción.
  5. Imprime la proporción de elementos positivos, negativos y cero en la array hasta con cuatro decimales.

A continuación se muestra la implementación del enfoque anterior.  

C++

// C++ program to find the ratio of positive,
// negative, and zero elements in the array.
#include<bits/stdc++.h>
using namespace std;
 
 
// Function to find the ratio of
// positive, negative, and zero elements
void positiveNegativeZero(int arr[], int len)
{
    // Initialize the postiveCount, negativeCount, and
    // zeroCountby 0 which will count the total number
    // of positive, negative and zero elements
    float positiveCount = 0;
    float negativeCount = 0;
    float zeroCount = 0;
 
    // Traverse the array and count the total number of
    // positive, negative, and zero elements.
    for (int i = 0; i < len; i++) {
        if (arr[i] > 0) {
            positiveCount++;
        }
        else if (arr[i] < 0) {
            negativeCount++;
        }
        else if (arr[i] == 0) {
            zeroCount++;
        }
    }
 
    // Print the ratio of positive,
    // negative, and zero elements
    // in the array up to four decimal places.
    cout << fixed << setprecision(4) << (positiveCount / len)<<" ";
    cout << fixed << setprecision(4) << (negativeCount / len)<<" ";
    cout << fixed << setprecision(4) << (zeroCount / len);
    cout << endl;
}
 
// Driver Code.
int main()
{
    // Test Case 1:
    int a1[] = { 2, -1, 5, 6, 0, -3 };
    int len=sizeof(a1)/sizeof(a1[0]);
    positiveNegativeZero(a1,len);
 
    // Test Case 2:
    int a2[] = { 4, 0, -2, -9, -7, 1 };
    len=sizeof(a2)/sizeof(a2[0]);
    positiveNegativeZero(a2,len);
}
 
// This code is contributed by chitranayal

Java

// Java program to find the ratio of positive,
// negative, and zero elements in the array.
 
class GFG {
 
    // Function to find the ratio of
    // positive, negative, and zero elements
    static void positiveNegativeZero(int[] arr)
    {
 
        // Store the array length into the variable len.
        int len = arr.length;
 
        // Initialize the postiveCount, negativeCount, and
        // zeroCountby 0 which will count the total number
        // of positive, negative and zero elements
        float positiveCount = 0;
        float negativeCount = 0;
        float zeroCount = 0;
 
        // Traverse the array and count the total number of
        // positive, negative, and zero elements.
        for (int i = 0; i < len; i++) {
            if (arr[i] > 0) {
                positiveCount++;
            }
            else if (arr[i] < 0) {
                negativeCount++;
            }
            else if (arr[i] == 0) {
                zeroCount++;
            }
        }
 
        // Print the ratio of positive,
        // negative, and zero elements
        // in the array up to four decimal places.
        System.out.printf("%1.4f ", positiveCount / len);
        System.out.printf("%1.4f ", negativeCount / len);
        System.out.printf("%1.4f ", zeroCount / len);
        System.out.println();
    }
 
    // Driver Code.
    public static void main(String args[])
    {
 
        // Test Case 1:
        int[] a1 = { 2, -1, 5, 6, 0, -3 };
        positiveNegativeZero(a1);
 
        // Test Case 2:
        int[] a2 = { 4, 0, -2, -9, -7, 1 };
        positiveNegativeZero(a2);
    }
}

Python3

# Python3 program to find the ratio of positive,
# negative, and zero elements in the array.
 
# Function to find the ratio of
# positive, negative, and zero elements
def positiveNegativeZero(arr):
 
    # Store the array length into the variable len.
    length = len(arr);
 
    # Initialize the postiveCount, negativeCount, and
    # zeroCountby 0 which will count the total number
    # of positive, negative and zero elements
    positiveCount = 0;
    negativeCount = 0;
    zeroCount = 0;
 
    # Traverse the array and count the total number of
    # positive, negative, and zero elements.
    for i in range(length):
        if (arr[i] > 0):
            positiveCount += 1;
        elif(arr[i] < 0):
            negativeCount += 1;
        elif(arr[i] == 0):
            zeroCount += 1;
         
    # Print the ratio of positive,
    # negative, and zero elements
    # in the array up to four decimal places.
    print("{0:.4f}".format((positiveCount / length)), end=" ");
    print("%1.4f "%(negativeCount / length), end=" ");
    print("%1.4f "%(zeroCount / length), end=" ");
    print();
 
# Driver Code.
if __name__ == '__main__':
 
    # Test Case 1:
    a1 = [ 2, -1, 5, 6, 0, -3 ];
    positiveNegativeZero(a1);
 
    # Test Case 2:
    a2 = [ 4, 0, -2, -9, -7, 1 ];
    positiveNegativeZero(a2);
     
# This code is contributed by Rajput-Ji

C#

// C# program to find the ratio of positive,
// negative, and zero elements in the array.
using System;
 
class GFG {
  
    // Function to find the ratio of
    // positive, negative, and zero elements
    static void positiveNegativeZero(int[] arr)
    {
  
        // Store the array length into the variable len.
        int len = arr.Length;
  
        // Initialize the postiveCount, negativeCount, and
        // zeroCountby 0 which will count the total number
        // of positive, negative and zero elements
        float positiveCount = 0;
        float negativeCount = 0;
        float zeroCount = 0;
  
        // Traverse the array and count the total number of
        // positive, negative, and zero elements.
        for (int i = 0; i < len; i++) {
            if (arr[i] > 0) {
                positiveCount++;
            }
            else if (arr[i] < 0) {
                negativeCount++;
            }
            else if (arr[i] == 0) {
                zeroCount++;
            }
        }
  
        // Print the ratio of positive,
        // negative, and zero elements
        // in the array up to four decimal places.
        Console.Write("{0:F4} ", positiveCount / len);
        Console.Write("{0:F4} ", negativeCount / len);
        Console.Write("{0:F4} ", zeroCount / len);
        Console.WriteLine();
    }
  
    // Driver Code.
    public static void Main(String []args)
    {
  
        // Test Case 1:
        int[] a1 = { 2, -1, 5, 6, 0, -3 };
        positiveNegativeZero(a1);
  
        // Test Case 2:
        int[] a2 = { 4, 0, -2, -9, -7, 1 };
        positiveNegativeZero(a2);
    }
}
 
// This code is contributed by sapnasingh4991

Javascript

<script>
 
// Javascript program to find the
// ratio of positive, negative, and
// zero elements in the array.
 
// Function to find the ratio of
// positive, negative, and zero elements
function positiveNegativeZero(arr)
{
     
    // Store the array length into
    // the variable len.
    let len = arr.length;
 
    // Initialize the postiveCount,
    // negativeCount, and zeroCountby
    // 0 which will count the total number
    // of positive, negative and zero elements
    let positiveCount = 0;
    let negativeCount = 0;
    let zeroCount = 0;
 
    // Traverse the array and count the
    // total number of positive, negative,
    // and zero elements.
    for(let i = 0; i < len; i++)
    {
        if (arr[i] > 0)
        {
            positiveCount++;
        }
        else if (arr[i] < 0)
        {
            negativeCount++;
        }
        else if (arr[i] == 0)
        {
            zeroCount++;
        }
    }
 
    // Print the ratio of positive,
    // negative, and zero elements
    // in the array up to four decimal places.
    document.write((positiveCount / len).toFixed(4) + " ");
    document.write((negativeCount / len).toFixed(4) + " ");
    document.write((zeroCount / len).toFixed(4));
    document.write("<br>");
}
 
// Driver Code.
 
// Test Case 1:
let a1 = [ 2, -1, 5, 6, 0, -3 ];
positiveNegativeZero(a1);
 
// Test Case 2:
let a2 = [ 4, 0, -2, -9, -7, 1 ];
positiveNegativeZero(a2);
 
// This code is contributed by sravan kumar G
 
</script>
Producción: 

0.5000 0.3333 0.1667 
0.3333 0.5000 0.1667

 

Complejidad de tiempo: O (len)

Espacio Auxiliar: O(1)

Publicación traducida automáticamente

Artículo escrito por prashant_srivastava y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA

Deja una respuesta

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *