查找最多两个有理数

给定两个有理数，任务是查找给定两个有理数的最大值。

例子 ：

Input : first = 3/4, second= 3/2
Output : 3/2

Input : first = 100/100, second = 300/400
Output : 100/100

一个简单的解决方案是找到浮点值并比较浮点值。浮点计算可能会导致精度错误。我们可以使用以下方法避免它们。

假设第一个= 3/2，第二个= 3/4

• 首先取(4，2)的LCM，这是有理数的分母。因此，这的LCM为4，然后分别用分母和倍数分别除以第一和第二的分子，因此分母值为第一分子= 6，第二分子= 3。
• 然后找到这两个之间的最大值。因此，这里的第一个分子为max，然后输出第一个有理数。

C++

// CPP program to find max between
// two Rational numbers
#include 
using namespace std;
  
struct Rational
{
    int nume, deno;
};
  
// Get lcm of two number's
int lcm(int a, int b) 
{
    return (a * b) / (__gcd(a, b));
}
  
// Get max rational number
Rational maxRational(Rational first, Rational sec)
{
    // Find the LCM of first->denominator
    // and sec->denominator
    int k = lcm(first.deno, sec.deno);
  
    // Declare nume1 and nume2 for get the value of
    // first numerator and second numerator
    int nume1 = first.nume;
    int nume2 = sec.nume;
  
    nume1 *= k / (first.deno);
    nume2 *= k / (sec.deno);
  
    return (nume2 < nume1)? first : sec;
}
  
// Driver Code
int main()
{
    Rational first = { 3, 2 };
    Rational sec = { 3, 4 };
  
    Rational res = maxRational(first, sec);
    cout << res.nume << "/" << res.deno;
    return 0;
}

Java

// JAVA program to find max between
// two Rational numbers
  
class GFG
{
  
static class Rational
{
    int nume, deno;
  
    public Rational(int nume, int deno) 
    {
        this.nume = nume;
        this.deno = deno;
    }
      
};
  
// Get lcm of two number's
static int lcm(int a, int b) 
{
    return (a * b) / (__gcd(a, b));
}
  
// Get max rational number
static Rational maxRational(Rational first, Rational sec)
{
    // Find the LCM of first.denominator
    // and sec.denominator
    int k = lcm(first.deno, sec.deno);
  
    // Declare nume1 and nume2 for get the value of
    // first numerator and second numerator
    int nume1 = first.nume;
    int nume2 = sec.nume;
  
    nume1 *= k / (first.deno);
    nume2 *= k / (sec.deno);
  
    return (nume2 < nume1)? first : sec;
}
static int __gcd(int a, int b) 
{ 
    return b == 0 ? a:__gcd(b, a % b);     
}
  
// Driver Code
public static void main(String[] args)
{
    Rational first = new Rational(3, 2 );
    Rational sec = new Rational(3, 4 );
  
    Rational res = maxRational(first, sec);
    System.out.print(res.nume+ "/" + res.deno);
}
}
  
// This code is contributed by Rajput-Ji

Python

# Python program to find max between 
# two Rational numbers 
import math
  
# Get lcm of two number's 
def lcm(a, b):
      
    return (a * b) // (math.gcd(a, b)) 
  
# Get max rational number 
def maxRational(first, sec):
  
    # Find the LCM of first->denominator 
    # and sec->denominator 
    k = lcm(first[1], sec[1]) 
      
    # Declare nume1 and nume2 for get the value of 
    # first numerator and second numerator 
    nume1 = first[0] 
    nume2 = sec[0] 
      
    nume1 *= k // (first[1]) 
    nume2 *= k // (sec[1]) 
      
    return first if (nume2 < nume1) else sec 
  
# Driver Code 
first = [3, 2]
sec = [3, 4]
res = maxRational(first, sec) 
print(res[0], "/", res[1], sep = "")
  
# This code is contributed by SHUBHAMSINGH10

C#

// C# program to find max between
// two Rational numbers
using System;
  
class GFG
{
  
class Rational
{
    public int nume, deno;
  
    public Rational(int nume, int deno) 
    {
        this.nume = nume;
        this.deno = deno;
    }
      
};
  
// Get lcm of two number's
static int lcm(int a, int b) 
{
    return (a * b) / (__gcd(a, b));
}
  
// Get max rational number
static Rational maxRational(Rational first, Rational sec)
{
    // Find the LCM of first.denominator
    // and sec.denominator
    int k = lcm(first.deno, sec.deno);
  
    // Declare nume1 and nume2 for get the value of
    // first numerator and second numerator
    int nume1 = first.nume;
    int nume2 = sec.nume;
  
    nume1 *= k / (first.deno);
    nume2 *= k / (sec.deno);
  
    return (nume2 < nume1)? first : sec;
}
static int __gcd(int a, int b) 
{ 
    return b == 0 ? a:__gcd(b, a % b);     
}
  
// Driver Code
public static void Main(String[] args)
{
    Rational first = new Rational(3, 2);
    Rational sec = new Rational(3, 4);
  
    Rational res = maxRational(first, sec);
    Console.Write(res.nume + "/" + res.deno);
}
}
  
// This code is contributed by 29AjayKumar

输出 ：

3/2