JAVA || beginner friendly || GCD
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        //gcd of numbers\n        if(nums.length == 0){\n            return false;\n        }\n        int ans = nums[0];\n        for(int i = 1;i < nums.length;i++){\n            ans = gcd(ans, nums[i]);\n        }\n        if(ans == 1) return true;\n        else return false;\n    }\n    public int gcd(int a, int b){\n        if(a == 0){\n            return b;\n        }\n        return gcd(b % a, a);\n    }\n}\n```
['Java']