java best solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean isGoodArray(int[] nums) {\n        int g = nums[0];\n        for(int i =1 ; i< nums.length ;i++){\n            g = gcd(g ,nums[i]);\n            if(g==1) break;\n        }\n        if(g==1) return true;\n        return false;\n    }\n\n    public static int gcd(int a, int b) {\n        while(a > 0 && b > 0) {\n            if(a > b) {\n               a = a % b;\n            }\n             else {\n                 b = b % a;\n            }\n        }\n              if(a == 0) {\n            return b;\n        }\n         return a;\n    }\n}\n```
['Java']