📌  相关文章
📜  给定数字的每个数字的频率中的2的最近幂

📅  最后修改于: 2021-04-17 14:58:01             🧑  作者: Mango

给定一个正整数N ，任务是打印N中存在的每个数字的频率中的2的最接近幂。如果对于任何频率，存在两个最接近的2的幂，则打印较大的一个。

例子：

方法：可以使用哈希解决给定的问题。请按照以下步骤解决给定的问题：

  • 初始化一个字符串，例如S，然后转换给定的整数N并将其存储在字符串S中。
  • 遍历字符串S并将每个字符的频率存储在Map中，例如M。
  • 现在，遍历Map M并打印Map中存储的每个数字的频率的2的最接近幂。

下面是上述方法的实现：

C++
// C++ program for the above approach
 
#include 
using namespace std;
 
// Function to find the nearest power of
// 2 for all frequencies in the Map freq
void nearestPowerOfTwoUtil(
    unordered_map& freq)
{
    // Traverse the Map
    for (auto& it : freq) {
 
        cout << it.first << " -> ";
 
        // Calculate log of the
        // current array element
        int lg = log2(it.second);
        int a = pow(2, lg);
        int b = pow(2, lg + 1);
 
        // Find the nearest power of 2
        // for the current frequency
        if ((it.second - a)
            < (b - it.second)) {
            cout << a << endl;
        }
        else {
            cout << b << endl;
        }
    }
}
 
// Function to find nearest power of 2
// for frequency of each digit of num
void nearestPowerOfTwo(string& S)
{
    // Length of string
    int N = S.size();
 
    // Stores the frequency of each
    // character in the string
    unordered_map freq;
 
    // Traverse the string S
    for (int i = 0; i < N; i++) {
        freq[S[i]]++;
    }
 
    // Function call to generate
    // nearest power of 2 for each
    // frequency
    nearestPowerOfTwoUtil(freq);
}
 
// Driver Code
int main()
{
    string N = "16333331163";
    nearestPowerOfTwo(N);
   
    return 0;
}

Java
// Java program for the above approach
import java.io.*;
import java.lang.*;
import java.util.*;
 
class GFG {
 
  // Function to find the nearest power of
  // 2 for all frequencies in the Map freq
  static void nearestPowerOfTwoUtil(HashMap freq)
  {
 
    // Traverse the Map
    for (char key : freq.keySet())
    {
      System.out.print(key + " -> ");
 
      // Calculate log of the
      // current array element
      int lg = (int)(Math.log(freq.get(key) / Math.log(2)));
      int a = (int)Math.pow(2, lg);
      int b = (int)Math.pow(2, lg + 1);
 
      // Find the nearest power of 2
      // for the current frequency
      if ((freq.get(key) - a) < (b - freq.get(key))) {
        System.out.println(a);
      }
      else {
        System.out.println(b);
      }
    }
  }
 
  // Function to find nearest power of 2
  // for frequency of each digit of num
  static void nearestPowerOfTwo(String S)
  {
 
    // Length of string
    int N = S.length();
 
    // Stores the frequency of each
    // character in the string
    HashMap freq = new HashMap<>();
 
    // Traverse the string S
    for (int i = 0; i < N; i++)
    {
      freq.put(S.charAt(i), freq.getOrDefault(S.charAt(i), 0) + 1);
    }
 
    // Function call to generate
    // nearest power of 2 for each
    // frequency
    nearestPowerOfTwoUtil(freq);
  }
 
  // Driver Code
  public static void main(String[] args)
  {
 
    String N = "16333331163";
    nearestPowerOfTwo(N);
  }
}
 
// This code is contributed by Kingash.

Python3
# Python3 program for the above approach
from math import log2, pow
 
# Function to find the nearest power of
# 2 for all frequencies in the Map freq
def nearestPowerOfTwoUtil(freq):
   
    # Traverse the Map
    temp = {}
    for key,value in freq.items():
       
        # Calculate log of the
        # current array element
        lg = int(log2(value))
        a  =  int(pow(2, lg))
        b  =  int(pow(2, lg + 1))
 
        # Find the nearest power of 2
        # for the current frequency
        if ((value - a) < (b - value)):
            temp[(int(a))] = key
        else:
            temp[(int(b))] = key
    for key,value in temp.items():
        print(value,"->",key)
         
# Function to find nearest power of 2
# for frequency of each digit of num
def nearestPowerOfTwo(S):
   
    # Length of string
    N = len(S)
 
    # Stores the frequency of each
    # character in the string
    freq = {}
 
    # Traverse the string S
    for i in range(N):
        if(S[i] in freq):
            freq[S[i]] += 1
        else:
            freq[S[i]] = 1
 
    # Function call to generate
    # nearest power of 2 for each
    # frequency
    nearestPowerOfTwoUtil(freq)
 
# Driver Code
if __name__ == '__main__':
    N = "16333331163"
    nearestPowerOfTwo(N)
 
    # This code is contributed by bgangwar59.

C#
// C# program for the above approach
using System;
using System.Collections.Generic;
 
class GFG{
 
// Function to find the nearest power of
// 2 for all frequencies in the Map freq
static void nearestPowerOfTwoUtil(
    Dictionary freq)
{
 
    // Traverse the Map
    foreach (KeyValuePair entry in freq)
    {
        char key = entry.Key;
        Console.Write(key + " -> ");
         
        // Calculate log of the
        // current array element
        int lg = (int)(Math.Log(freq[key] /
                       Math.Log(2)));
        int a = (int)Math.Pow(2, lg);
        int b = (int)Math.Pow(2, lg + 1);
         
        // Find the nearest power of 2
        // for the current frequency
        if ((freq[key] - a) < (b - freq[key]))
        {
            Console.Write(a + "\n");
        }
        else
        {
            Console.Write(b + "\n");
        }
    }
}
 
// Function to find nearest power of 2
// for frequency of each digit of num
static void nearestPowerOfTwo(string S)
{
     
    // Length of string
    int N = S.Length;
     
    // Stores the frequency of each
    // character in the string
    Dictionary freq = new Dictionary();
     
    // Traverse the string S
    for(int i = 0; i < N; i++)
    {
        if (freq.ContainsKey(S[i]))
            freq[S[i]] += 1;
        else
            freq[S[i]] = 1;
    }
     
    // Function call to generate
    // nearest power of 2 for each
    // frequency
    nearestPowerOfTwoUtil(freq);
}
 
// Driver Code
public static void Main()
{
    string N = "16333331163";
     
    nearestPowerOfTwo(N);
}
}
 
// This code is contributed by ipg2016107

输出： 
3 -> 8
1 -> 4
6 -> 2

时间复杂度： O(log 10 N)
辅助空间： O(1)