mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
46 lines
1.3 KiB
HTML
46 lines
1.3 KiB
HTML
<p>Given an integer array <code>nums</code>, return<strong> </strong><em>the <strong>greatest common divisor</strong> of the smallest number and largest number in </em><code>nums</code>.</p>
|
|
|
|
<p>The <strong>greatest common divisor</strong> of two numbers is the largest positive integer that evenly divides both numbers.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,5,6,9,10]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong>
|
|
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>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [7,5,6,8,3]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong>
|
|
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>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,3]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong>
|
|
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>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= nums.length <= 1000</code></li>
|
|
<li><code>1 <= nums[i] <= 1000</code></li>
|
|
</ul>
|