add 697 725 scripts.

Author: everthis

697-degree-of-an-array.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+const findShortestSubArray = function(nums) {
+  const left = {};
+  const right = {};
+  const count = {};
+
+  for (let i = 0; i < nums.length; i++) {
+    if (!left.hasOwnProperty(nums[i])) {
+      left[nums[i]] = i;
+    }
+    right[nums[i]] = i;
+    count[nums[i]] = count[nums[i]] ? count[nums[i]] + 1 : 1;
+  }
+  const degree = Math.max(...Object.keys(count).map(el => count[el]));
+  let res = nums.length;
+  for (let el in count) {
+    if (count.hasOwnProperty(el) && count[el] === degree) {
+      res = Math.min(res, right[el] - left[el] + 1);
+    }
+  }
+
+  return res;
+};

725-split-linked-list-in-parts.js

@@ -0,0 +1,37 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} root
+ * @param {number} k
+ * @return {ListNode[]}
+ */
+const splitListToParts = function(root, k) {
+  let cur = root;
+  let N = 0;
+  while (cur != null) {
+    cur = cur.next;
+    N++;
+  }
+  let width = Math.floor(N / k),
+    rem = N % k;
+  let ans = [];
+  cur = root;
+  for (let i = 0; i < k; ++i) {
+    let head = cur;
+    for (let j = 0; j < width + (i < rem ? 1 : 0) - 1; ++j) {
+      if (cur != null) cur = cur.next;
+    }
+    if (cur != null) {
+      let prev = cur;
+      cur = cur.next;
+      prev.next = null;
+    }
+    ans[i] = head;
+  }
+  return ans;
+};