Es pot utilitzar una pantalla de set segments per mostrar números. Donada una matriu de n nombres naturals. La tasca és trobar el nombre de la matriu que utilitza el nombre mínim de segments per mostrar el nombre. Si diversos nombres tenen un nombre mínim de segments, emet el nombre que tingui l'índex més petit.
Exemples:
Entrada: arr[] = { 1 2 3 4 5 }.
Sortida: 1
Explicació: L'element que utilitza el nombre mínim de segments és 1 (és a dir, 2 segments)Entrada: arr[] = { 489 206 745 123 756 }.
Sortida: 745
Explicació: L'element amb l'índex més petit que utilitza el nombre mínim de segments és 745 (és a dir, 12 segments)
La idea és calcular prèviament el nombre de segment utilitzat pels dígits del 0 al 9 i emmagatzemar-lo. Ara, per a cada element de la matriu, sumeu el nombre de segment utilitzat per cada dígit. A continuació, trobeu l'element que utilitza el nombre mínim de segments.
C++El nombre de segment utilitzat per dígit:
0 -> 6
1 -> 2
2 -> 5
3 -> 5
4 -> 4
5 -> 5
6 -> 6
7 -> 3
8 -> 7
9 -> 6
#include
import java.io.*; class GFG { // Precomputed values of segment // used by digit 0 to 9. static int []seg = { 6 2 5 5 4 5 6 3 7 6}; // Return the number of segments used by x. static int computeSegment(int x) { if (x == 0) return seg[0]; int count = 0; // Finding sum of the segment used by // each digit of a number. while (x > 0) { count += seg[x % 10]; x /= 10; } return count; } static int elementMinSegment(int []arr int n) { // Initialising the minimum segment // and minimum number index. int minseg = computeSegment(arr[0]); int minindex = 0; // Finding and comparing segment used // by each number arr[i]. for (int i = 1; i < n; i++) { int temp = computeSegment(arr[i]); // If arr[i] used less segment then update // minimum segment and minimum number. if (temp < minseg) { minseg = temp; minindex = i; } } return arr[minindex]; } static public void main (String[] args) { int []arr = {489 206 745 123 756}; int n = arr.length; System.out.println(elementMinSegment(arr n)); } }
# Precomputed values of segment # used by digit 0 to 9. seg = [6 2 5 5 4 5 6 3 7 6] # Return the number of # segments used by x. def computeSegment(x): if(x == 0): return seg[0] count = 0 # Finding sum of the segment # used by each digit of a number. while(x): count += seg[x % 10] x = x // 10 return count # function to return minimum sum index def elementMinSegment(arr n): # Initialising the minimum # segment and minimum number index. minseg = computeSegment(arr[0]) minindex = 0 # Finding and comparing segment # used by each number arr[i]. for i in range(1 n): temp = computeSegment(arr[i]) # If arr[i] used less segment # then update minimum segment # and minimum number. if(temp < minseg): minseg = temp minindex = i return arr[minindex] # Driver Code arr = [489 206 745 123 756] n = len(arr) # function print required answer print(elementMinSegment(arr n)) # This code is contributed by # Sanjit_Prasad
using System; class GFG{ // Precomputed values of segment // used by digit 0 to 9. static int []seg = new int[10]{ 6 2 5 5 4 5 6 3 7 6}; // Return the number of segments used by x. static int computeSegment(int x) { if (x == 0) return seg[0]; int count = 0; // Finding sum of the segment used by // each digit of a number. while (x > 0) { count += seg[x % 10]; x /= 10; } return count; } static int elementMinSegment(int []arr int n) { // Initialising the minimum segment // and minimum number index. int minseg = computeSegment(arr[0]); int minindex = 0; // Finding and comparing segment used // by each number arr[i]. for (int i = 1; i < n; i++) { int temp = computeSegment(arr[i]); // If arr[i] used less segment then update // minimum segment and minimum number. if (temp < minseg) { minseg = temp; minindex = i; } } return arr[minindex]; } static public void Main() { int []arr = {489 206 745 123 756}; int n = arr.Length; Console.WriteLine(elementMinSegment(arr n)); } }
// Precomputed values of segment // used by digit 0 to 9. let seg = [ 6 2 5 5 4 5 6 3 7 6]; // Return the number of segments used by x. function computeSegment(x) { if (x == 0) return seg[0]; let count = 0; // Finding sum of the segment used by // each digit of a number. while (x > 0) { count += seg[x % 10]; x = parseInt(x / 10 10); } return count; } function elementMinSegment(arr n) { // Initialising the minimum segment // and minimum number index. let minseg = computeSegment(arr[0]); let minindex = 0; // Finding and comparing segment used // by each number arr[i]. for(let i = 1; i < n; i++) { let temp = computeSegment(arr[i]); // If arr[i] used less segment then update // minimum segment and minimum number. if (temp < minseg) { minseg = temp; minindex = i; } } return arr[minindex]; } // Driver code let arr = [ 489 206 745 123 756 ]; let n = arr.length; console.log(elementMinSegment(arr n));
Sortida
745
Complexitat temporal: O(n * log 10 n)
Espai auxiliar: O(10)