g2401_2500.s2427_number_of_common_factors.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g2401_2500.s2427_number_of_common_factors;

// #Easy #Math #Enumeration #Number_Theory #2022_12_07_Time_1_ms_(81.93%)_Space_38.7_MB_(98.17%)

/**
 * 2427 - Number of Common Factors\.
 *
 * Easy
 *
 * Given two positive integers `a` and `b`, return _the number of **common** factors of_ `a` _and_ `b`.
 *
 * An integer `x` is a **common factor** of `a` and `b` if `x` divides both `a` and `b`.
 *
 * **Example 1:**
 *
 * **Input:** a = 12, b = 6
 *
 * **Output:** 4
 *
 * **Explanation:** The common factors of 12 and 6 are 1, 2, 3, 6.
 *
 * **Example 2:**
 *
 * **Input:** a = 25, b = 30
 *
 * **Output:** 2
 *
 * **Explanation:** The common factors of 25 and 30 are 1, 5.
 *
 * **Constraints:**
 *
 * *   `1 <= a, b <= 1000`
**/
public class Solution {
    public int commonFactors(int a, int b) {
        int ans = 0;
        for (int i = 1; i <= Math.min(a, b); i++) {
            if (a % i == 0 && b % i == 0) {
                ans++;
            }
        }
        return ans;
    }
}