Java Sol using Bezout's Identity
Explanation:\n\nBezout\'s Identity\n        \n        let a and b be integers with greatest common divisor as d\n        then there exist integers x and y such 
# Explanation:\n\n*Bezout\'s Identity*\n        \n        let a and b be integers with greatest common divisor as d\n        then there exist integers x and y such that ax + by = d\n        \n        In Example 1,\n\n        a=5, x=3, b=7, y=-2\n        So, 5*3 + 7*(-2) = 1\n        \n        \n\n\n\n\n# Code\n```\nclass Solution {\n    public boolean isGoodArray(int[] nums) {\n       \n\n        //Basically check for GCD and return true if its 1\n\n        int x = nums[0], y;\n        for(int a : nums){\n        while(a > 0){\n          y = x%a;\n          x = a;\n          a = y;\n         }\n    }\n\n        return x == 1;\n    }\n}\n```
['Java']