Find Greatest Common Divisor of Array LeetCode solution in Java

1
class Solution {
2
  public int findGCD(int[] nums) {
3
    Arrays.sort(nums);
4
    int n = nums[nums.length - 1];
5
    int result = nums[0];
6
    while (result > 0) {
7
      if (nums[0] % result == 0 && n % result == 0) {
8
        break;
9
      }
10
      result--;
11
    }
12
    return result;
13
  }
14
}