feat: modify question number

Author: yinxin630

1308.解码字母到整数映射.js renamed to 1309.解码字母到整数映射.js

@@ -26,5 +26,3 @@ var freqAlphabets = function(s) {
     }
     return result.join('');
 };
-
-// console.log(freqAlphabets("12345678910#11#12#13#14#15#16#17#18#19#20#21#22#23#24#25#26#"));

1309.子数组异或查询.js renamed to 1310.子数组异或查询.js

@@ -23,10 +23,3 @@ var xorQueries = function(arr, queries) {
 
     return result;
 };
-
-// console.log(xorQueries(arr = [1,3,4,8], queries = [[0,1],[1,2],[0,3],[3,3]]));
-// console.log(xorQueries(arr = [4,8,2,10], queries = [[2,3],[1,3],[0,0],[0,3]]));
-
-// const arr = new Array(30000).fill(3);
-// const queries = new Array(30000).fill([0, 29999]);
-// console.log(xorQueries(arr, queries));

1310.获取你好友已观看的视频.js

@@ -0,0 +1,61 @@
+/*
+ * @lc app=leetcode.cn id=1310 lang=javascript
+ *
+ * [1310] 获取你好友已观看的视频
+ * 
+ * 1. 好友关系构成了无向图, 获取指定层级的好友关系时要排除环
+ * 2. 使用双数组遍历好友关系, 因为俩人可能是同一人的好友, 因此用了 Set 去重
+ * 3. 取到 n 层级的人之后, 计算各电影观看次数, 最后做个排序即可
+ * 
+ */
+
+ /**
+ * @param {string[][]} watchedVideos
+ * @param {number[][]} friends
+ * @param {number} id
+ * @param {number} level
+ * @return {string[]}
+ */
+var watchedVideosByFriends = function(watchedVideos, friends, id, level) {
+    const set = new Set([id]);
+    let list1 = new Set([id]);
+    let list2 = new Set();
+    while (level > 0) {
+        const current = list1.size ? list1 : list2;
+        const next = list1.size ? list2 : list1;
+
+        for (const n of current) {
+            for (const f of friends[n]) {
+                if (!set.has(f)) {
+                    next.add(f);
+                    set.add(f);
+                }
+            }
+        }
+
+        level--;
+        current.clear();
+    }
+
+    const peoples = Array.from(list1.size ? list1 : list2);
+
+    const map = {};
+    for (const p of peoples) {
+        for (const w of watchedVideos[p]) {
+            map[w] = map[w] || 0;
+            map[w]++;
+        }
+    }
+
+    const result = Object.entries(map).sort((a, b) => {
+        if (a[1] < b[1]) {
+            return -1;
+        } else if (a[1] > b[1]) {
+            return 1;
+        } else {
+            return a[0] < b[0] ? -1 : 1;
+        }
+    }).map(x => x[0]);
+
+    return result;
+};

1311.获取你好友已观看的视频.js

@@ -23,8 +23,6 @@ var minInsertions = function(s) {
     const b = s.split('').reverse().join('');
     const dp = [];
 
-    // console.log(a, b);
-
     for (let i = 0; i <= a.length; i++) {
         dp[i] = [];
         for (let j = 0; j <= b.length; j++) {
@@ -40,8 +38,5 @@ var minInsertions = function(s) {
         }
     }
 
-    // console.log(dp);
     return s.length - dp[s.length][s.length];
 };
-
-// console.log(minInsertions("no"));