Merge branch '황은지' of https://github.com/CodingTestStudy2/Daily_Coding_Test into 황은지

Author: dmswl6310

leetcode3/황은지/3014. Minimum Number of Pushes to Type Word I.js

@@ -0,0 +1,22 @@
+/**
+ * @param {string} word
+ * @return {number}
+ */
+var minimumPushes = function(word) {
+    // 최대한 한번만 누르게 -> 그래도 부족한건 2개, 3개짜리로..
+    let cost=0;
+    let click=1;
+    let left=word.length;
+
+    while(left>0){
+        if(left<=8){ 
+            cost+=(left*(click++))
+            break;
+        }else{
+            left-=8;
+            cost+=(8*(click++));
+        }
+    }
+
+    return cost;
+};

leetcode3/황은지/3701. Compute Alternating Sum.js

@@ -0,0 +1,14 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var alternatingSum = function(nums) {
+    let result=0;
+
+    for(let i=0;i<nums.length;i++){
+        if(i%2===0) result+=nums[i];
+        else result-=nums[i];
+    }
+
+    return result;
+};

leetcode3/황은지/785. Is Graph Bipartite.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[][]} graph
+ * @return {boolean}
+ */
+var isBipartite = function (graph) {
+  const nodeCount = graph.length;
+  const setFlag = Array(nodeCount);
+  const queue = [0];
+  setFlag[0] = true;
+  let head = 0;
+
+  while (queue.length - head > 0) {
+    const curNode = queue[head++];
+    console.log(curNode, "curNode");
+    for (let i = 0; i < graph[curNode].length; i++) {
+      const nextNode = graph[curNode][i];
+      console.log(nextNode, "nextNode");
+      if (setFlag[nextNode] === setFlag[curNode]) return false;
+      setFlag[nextNode] = !setFlag[curNode];
+      queue.push(nextNode);
+    }
+  }
+
+  return true;
+};