Skip to content

Commit c4ae3d2

Browse files
solves number of common factors
1 parent 217c315 commit c4ae3d2

File tree

2 files changed

+18
-1
lines changed

2 files changed

+18
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -770,7 +770,7 @@
770770
| 2413 | [Smallest Even Multiple](https://leetcode.com/problems/smallest-even-multiple) | [![Java](assets/java.png)](src/SmallestEvenMultiple.java) | |
771771
| 2418 | [Sort the People](https://leetcode.com/problems/sort-the-people) | [![Java](assets/java.png)](src/SortThePeople.java) | |
772772
| 2423 | [Remove Letter To Equalize Frequency](https://leetcode.com/problems/remove-letter-to-equalize-frequency) | [![Java](assets/java.png)](src/RemoveLetterToEqualizeFrequency.java) | |
773-
| 2427 | [Number of Common Factors](https://leetcode.com/problems/number-of-common-factors) | | |
773+
| 2427 | [Number of Common Factors](https://leetcode.com/problems/number-of-common-factors) | [![Java](assets/java.png)](src/NumberOfCommonFactors.java) | |
774774
| 2432 | [The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task) | | |
775775
| 2437 | [Number of Valid Clock Times](https://leetcode.com/problems/number-of-valid-clock-times) | | |
776776
| 2441 | [Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative) | | |

src/NumberOfCommonFactors.java

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
// https://leetcode.com/problems/number-of-common-factors
2+
// T: O(min(a, b))
3+
// S: O(1)
4+
5+
public class NumberOfCommonFactors {
6+
public int commonFactors(int a, int b) {
7+
final int min = Math.min(a, b);
8+
int commonFactors = 1;
9+
10+
for (int factor = 2 ; factor <= min ; factor++) {
11+
if (a % factor == 0 & b % factor == 0) {
12+
commonFactors++;
13+
}
14+
}
15+
return commonFactors;
16+
}
17+
}

0 commit comments

Comments
 (0)