check-if-it-is-a-good-array

Author: masx200

README.md

@@ -49,6 +49,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths
+
+https://leetcode.cn/problems/check-if-it-is-a-good-array
+
 https://leetcode.cn/problems/maximum-number-of-groups-getting-fresh-donuts/
 
 https://leetcode.cn/problems/check-if-point-is-reachable/

check-if-it-is-a-good-array/format.json

@@ -0,0 +1,14 @@
+{
+    "style": "WebKit",
+    "filter": [
+        "*.c",
+        "*.cc",
+        "*.cpp",
+        "*.h",
+        "*.hh",
+        "*.hpp"
+    ],
+    "dirs": [
+        "./"
+    ]
+}

check-if-it-is-a-good-array/index.hpp

@@ -0,0 +1,34 @@
+// +build ignore
+
+#pragma once
+#include <vector>
+
+using namespace std;
+template <class InputIt, class T, class BinaryOperation>
+constexpr // since C++20
+    T
+    accumulate2(InputIt first, InputIt last, T init, BinaryOperation op)
+{
+    for (; first != last; ++first)
+        init = op(std::move(init), *first); // std::move since C++11
+
+    return init;
+};
+int gcd2(int num1, int num2)
+{
+    while (num2 != 0) {
+        int temp = num1;
+        num1 = num2;
+        num2 = temp % num2;
+    }
+    return num1;
+};
+
+class Solution {
+public:
+    bool isGoodArray(vector<int>& nums)
+    {
+        int divisor = accumulate2(nums.begin(), nums.end(), nums[0], gcd2);
+        return divisor == 1;
+    }
+};

check-if-it-is-a-good-array/test.cpp

@@ -0,0 +1 @@
+// +build ignore

format.json

@@ -0,0 +1,14 @@
+{
+    "style": "WebKit",
+    "filter": [
+        "*.c",
+        "*.cc",
+        "*.cpp",
+        "*.h",
+        "*.hh",
+        "*.hpp"
+    ],
+    "dirs": [
+        "./"
+    ]
+}