Java solution | 0ms
```\nclass Solution {\n    public boolean isGoodArray(int[] nums) {\n        int t = nums[0];\n        for (int i = 0; i < nums.length; i++) {\n            t = 
```\nclass Solution {\n    public boolean isGoodArray(int[] nums) {\n        int t = nums[0];\n        for (int i = 0; i < nums.length; i++) {\n            t = gcd(nums[i], t);\n            if (t == 1)\n                return true;\n            \n        }\n        return false;\n    }\n\n    public int gcd(int a, int b) {\n        if (a < b)\n            return gcd(b, a);\n        return a % b == 0 ? b : gcd(b, a % b);\n    }\n}
[]