[이준열] Day 23

leetcode2/1easy/이준열/1773.cpp

@@ -0,0 +1,19 @@
+class Solution {
+    public:
+        int countMatches(vector<vector<string>>& items, string ruleKey, string ruleValue) {
+            int output = 0;
+            int checkIndex = 0;
+            if (ruleKey == "type")
+                checkIndex = 0;
+            else if (ruleKey == "color")
+                checkIndex = 1;
+            else
+                checkIndex = 2;
+            for (vector<string> v: items)
+            {
+                if (v[checkIndex] == ruleValue)
+                    output++;
+            }
+            return output;
+        }
+    };

leetcode2/2medium/이준열/3191.cpp

@@ -0,0 +1,29 @@
+class Solution {
+    public:
+        void flipTuple(int &a, int &b, int &c)
+        {
+            a = (a == 1) ? 0 : 1;
+            b = (b == 1) ? 0 : 1;
+            c = (c == 1) ? 0 : 1;
+        }
+
+
+        int minOperations(vector<int>& nums) {
+            int minOp = 0;
+
+            for (int i = 0; i < nums.size() -2;i++)
+            {
+                if (nums[i] == 0)
+                {
+                    minOp++;
+                    flipTuple(nums[i], nums[i+1], nums[i+2]);
+                }
+            }
+
+            if (nums[nums.size() - 3] != 1 ||
+                nums[nums.size() - 2] != 1 ||
+                nums[nums.size() - 1] != 1)
+                return -1;
+            return minOp;
+        }
+    };