Find-Greatest-Common-Divisor-of-Array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code>, return the greatest common divisor of the smallest number and largest number in <code>nums</code>.

The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.

&nbsp;
Example 1:

<pre>
Input: nums = [2,5,6,9,10]
Output: 2
Explanation:
The smallest number in nums is 2.
The largest number in nums is 10.
The greatest common divisor of 2 and 10 is 2.
</pre>

Example 2:

<pre>
Input: nums = [7,5,6,8,3]
Output: 1
Explanation:
The smallest number in nums is 3.
The largest number in nums is 8.
The greatest common divisor of 3 and 8 is 1.
</pre>

Example 3:

<pre>
Input: nums = [3,3]
Output: 3
Explanation:
The smallest number in nums is 3.
The largest number in nums is 3.
The greatest common divisor of 3 and 3 is 3.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
</ul>

findGCD

Find Greatest Common Divisor of Array

Greatest Common Divisor of Strings

greatest-common-divisor-of-strings

字符串的最大公因子

Number of Different Subsequences GCDs

number-of-different-subsequences-gcds

序列中不同最大公约数的数目

Three Divisors

three-divisors

三除数

Smallest Even Multiple

smallest-even-multiple

最小偶倍数

Number of Subarrays With GCD Equal to K

number-of-subarrays-with-gcd-equal-to-k

最大公因数等于 K 的子数组数目

Find the Number of Subsequences With Equal GCD

find-the-number-of-subsequences-with-equal-gcd

最大公约数相等的子序列数量

Maximum Subarray With Equal Products

maximum-subarray-with-equal-products

最长乘积等价子数组

find-greatest-common-divisor-of-array

Array

Math

Number Theory

给你一个整数数组 <code>nums</code> ，返回数组中最大数和最小数的 最大公约数 。

两个数的&nbsp;最大公约数 是能够被两个数整除的最大正整数。

&nbsp;

示例 1：

<pre>输入：nums = [2,5,6,9,10]
输出：2
解释：
nums 中最小的数是 2
nums 中最大的数是 10
2 和 10 的最大公约数是 2
</pre>

示例 2：

<pre>输入：nums = [7,5,6,8,3]
输出：1
解释：
nums 中最小的数是 3
nums 中最大的数是 8
3 和 8 的最大公约数是 1
</pre>

示例 3：

<pre>输入：nums = [3,3]
输出：3
解释：
nums 中最小的数是 3
nums 中最大的数是 3
3 和 3 的最大公约数是 3
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
</ul>