📜  数组中最大和最小的斐波那契数

📅  最后修改于: 2021-10-27 07:59:49             🧑  作者: Mango

给定一个由N 个正整数组成的数组 arr[] ,任务是找到给定数组中的最小(最小)和最大(最大)斐波那契元素。
例子:

方法:此方法类似于查找数组中的最小和最大元素。一一遍历数组,检查它是否是斐波那契数。如果是,则在这些数字中找到最大值和最小值。
为了检查数字是否是斐波那契数或不是最优的 O(1),使用动态规划生成直到数组最大元素的所有斐波那契数,并将它们存储在哈希表中。
下面是上述方法的实现:

C++
// C++ program to find minimum and maximum
// fibonacci number in given array
#include 
using namespace std;
 
// Function to create hash table
// to check Fibonacci numbers
void createHash(set& hash,
                int maxElement)
{
    // Insert initial two numbers
    // in the hash table
    int prev = 0, curr = 1;
    hash.insert(prev);
    hash.insert(curr);
 
    while (curr <= maxElement) {
 
        // Sum of previous two numbers
        int temp = curr + prev;
 
        hash.insert(temp);
 
        // Update the variable each time
        prev = curr;
        curr = temp;
    }
}
 
// Function to find minimum and maximum
// fibonacci number in given array
void fibonacci(int arr[], int n)
{
 
    // Find maximum value in the array
    int max_val
        = *max_element(
            arr, arr + n);
 
    // Creating a set containing
    // all Fibonacci numbers up to
    // maximum value in the array
    set hash;
    createHash(hash, max_val);
 
    // For storing the Minimum
    // and Maximum Fibonacci number
    int minimum = INT_MAX;
    int maximum = INT_MIN;
 
    for (int i = 0; i < n; i++) {
 
        // Check if current element
        // is a fibonacci number
        if (hash.find(arr[i]) != hash.end()) {
 
            // Update the maximum and
            // minimum accordingly
            minimum = min(minimum, arr[i]);
            maximum = max(maximum, arr[i]);
        }
    }
 
    cout << minimum << ", "
         << maximum << endl;
}
 
// Driver code
int main()
{
 
    int arr[] = { 1, 2, 3, 4, 5, 6, 7 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    fibonacci(arr, n);
 
    return 0;
}


Java
// Java program to find minimum and maximum
// fibonacci number in given array
import java.util.*;
 
class GFG{
  
// Function to create hash table
// to check Fibonacci numbers
static void createHash(HashSet hash,
                int maxElement)
{
    // Insert initial two numbers
    // in the hash table
    int prev = 0, curr = 1;
    hash.add(prev);
    hash.add(curr);
  
    while (curr <= maxElement) {
  
        // Sum of previous two numbers
        int temp = curr + prev;
  
        hash.add(temp);
  
        // Update the variable each time
        prev = curr;
        curr = temp;
    }
}
  
// Function to find minimum and maximum
// fibonacci number in given array
static void fibonacci(int arr[], int n)
{
  
    // Find maximum value in the array
    int max_val= Arrays.stream(arr).max().getAsInt();
  
    // Creating a set containing
    // all Fibonacci numbers up to
    // maximum value in the array
    HashSet hash = new HashSet();
    createHash(hash, max_val);
  
    // For storing the Minimum
    // and Maximum Fibonacci number
    int minimum = Integer.MAX_VALUE;
    int maximum = Integer.MIN_VALUE;
  
    for (int i = 0; i < n; i++) {
  
        // Check if current element
        // is a fibonacci number
        if (hash.contains(arr[i])) {
  
            // Update the maximum and
            // minimum accordingly
            minimum = Math.min(minimum, arr[i]);
            maximum = Math.max(maximum, arr[i]);
        }
    }
  
    System.out.print(minimum+ ", "
         + maximum +"\n");
}
  
// Driver code
public static void main(String[] args)
{
  
    int arr[] = { 1, 2, 3, 4, 5, 6, 7 };
    int n = arr.length;
  
    fibonacci(arr, n);
  
}
}
 
// This code is contributed by sapnasingh4991


Python3
# Python 3 program to find minimum and maximum
# fibonacci number in given array
 
import sys
 
# Function to create hash table
# to check Fibonacci numbers
def createHash(hash, maxElement):
    # Insert initial two numbers
    # in the hash table
    prev = 0
    curr = 1
    hash.add(prev)
    hash.add(curr)
 
    while (curr <= maxElement):
        # Sum of previous two numbers
        temp = curr + prev
 
        hash.add(temp)
        # Update the variable each time
        prev = curr
        curr = temp
 
# Function to find minimum and maximum
# fibonacci number in given array
def fibonacci(arr, n):
 
    # Find maximum value in the array
    max_val = max(arr)
 
    # Creating a set containing
    # all Fibonacci numbers up to
    # maximum value in the array
    hash = set()
    createHash(hash, max_val)
 
    # For storing the Minimum
    # and Maximum Fibonacci number
    minimum = sys.maxsize
    maximum = -sys.maxsize-1
 
    for i in range(n):
 
        # Check if current element
        # is a fibonacci number
        if (arr[i] in hash):
 
            # Update the maximum and
            # minimum accordingly
            minimum = min(minimum, arr[i])
            maximum = max(maximum, arr[i])
 
    print(minimum,end = ", ")
    print(maximum)
 
# Driver code
if __name__ == '__main__':
    arr = [1, 2, 3, 4, 5, 6, 7]
    n = len(arr)
 
    fibonacci(arr, n)
 
# This code is contributed by Surendra_Gangwar


C#
// C# program to find minimum and maximum
// fibonacci number in given array
using System;
using System.Linq;
using System.Collections.Generic;
 
class GFG{
 
// Function to create hash table
// to check Fibonacci numbers
static void createHash(HashSet hash,
                int maxElement)
{
    // Insert initial two numbers
    // in the hash table
    int prev = 0, curr = 1;
    hash.Add(prev);
    hash.Add(curr);
 
    while (curr <= maxElement) {
 
        // Sum of previous two numbers
        int temp = curr + prev;
 
        hash.Add(temp);
 
        // Update the variable each time
        prev = curr;
        curr = temp;
    }
}
 
// Function to find minimum and maximum
// fibonacci number in given array
static void fibonacci(int []arr, int n)
{
 
    // Find maximum value in the array
    int max_val= arr.Max();
 
    // Creating a set containing
    // all Fibonacci numbers up to
    // maximum value in the array
    HashSet hash = new HashSet();
    createHash(hash, max_val);
 
    // For storing the Minimum
    // and Maximum Fibonacci number
    int minimum = int.MaxValue;
    int maximum = int.MinValue;
 
    for (int i = 0; i < n; i++) {
 
        // Check if current element
        // is a fibonacci number
        if (hash.Contains(arr[i])) {
 
            // Update the maximum and
            // minimum accordingly
            minimum = Math.Min(minimum, arr[i]);
            maximum = Math.Max(maximum, arr[i]);
        }
    }
 
    Console.Write(minimum+ ", "
        + maximum +"\n");
}
 
// Driver code
public static void Main(String[] args)
{
    int []arr = { 1, 2, 3, 4, 5, 6, 7 };
    int n = arr.Length;
 
    fibonacci(arr, n);
}
}
 
// This code is contributed by Princi Singh


Javascript


输出:
1, 5

如果您希望与专家一起参加现场课程,请参阅DSA 现场工作专业课程学生竞争性编程现场课程