fix: zen 模式报错

Author: robot

src/contentScript.js

@@ -4,7 +4,13 @@
 // import ReactDOM from "react-dom";
 // import { Menu, Dropdown, Button } from "antd";
 // import { DownOutlined, UserOutlined } from "@ant-design/icons";
-import { copyToClipboard, bjwd, getStorage, setCloundStorage } from "./utils";
+import {
+  copyToClipboard,
+  bjwd,
+  getStorage,
+  setCloundStorage,
+  addStyle,
+} from "./utils";
 import zenAble from "./zen/zenMode";
 
 // WTF!  ant message didn't go well with chrome extension?
@@ -331,6 +337,14 @@ function insertButton() {
 let inserted = false;
 let retried = 0;
 const MAX_TRY = 10;
+
+// 去除智能提示
+// addStyle(`
+// .monaco-editor .editor-widget {
+//   display: none !important;
+//   visibility: hidden !important;
+// }
+// `);
 const timerId = setInterval(() => {
   if (inserted) return clearInterval(timerId);
   if (retried > MAX_TRY) {

src/db/root.db.js

@@ -10464,11 +10464,11 @@
     "code": [
         {
             "language": "js",
-            "text": "\n/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar sortArray = function(nums) {\n    const counts = Array(50000 * 2 + 1).fill(0);\n    const res = [];\n    for(const num of nums) counts[50000 + num] += 1;\n    for(let i in counts)  {\n        while(counts[i]--) {\n            res.push(i - 50000)\n        }\n    }\n    return res;\n};\n"
+            "text": "\n/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar sortArray = function (nums) {\n  const counts = Array(50000 * 2 + 1).fill(0);\n  const res = [];\n  for (const num of nums) counts[50000 + num] += 1;\n  for (let i in counts) {\n    while (counts[i]--) {\n      res.push(i - 50000);\n    }\n  }\n  return res;\n};\n"
         },
         {
             "language": "js",
-            "text": "\nfunction swap(nums, a, b) {\n    const temp = nums[a];\n    nums[a] = nums[b];\n    nums[b] = temp;\n}\n\nfunction helper(nums, start, end) {\n    if (start >= end) return;\n    const pivotIndex = start + ((end - start) >>> 1)\n    const pivot = nums[pivotIndex]\n    let i = start;\n    let j = end;\n    while (i <= j) {\n        while (nums[i] < pivot) i++;\n        while (nums[j] > pivot) j--;\n        if (i <= j) {\n            swap(nums, i, j);\n            i++;\n            j--;\n        }\n    }\n    helper(nums, start, j);\n    helper(nums, i, end);\n}\n\n/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar sortArray = function(nums) {\n    helper(nums, 0, nums.length - 1);\n    return nums;\n};\n"
+            "text": "\nfunction swap(nums, a, b) {\n  const temp = nums[a];\n  nums[a] = nums[b];\n  nums[b] = temp;\n}\n\nfunction helper(nums, start, end) {\n  if (start >= end) return;\n  const pivotIndex = start + ((end - start) >>> 1);\n  const pivot = nums[pivotIndex];\n  let i = start;\n  let j = end;\n  while (i <= j) {\n    while (nums[i] < pivot) i++;\n    while (nums[j] > pivot) j--;\n    if (i <= j) {\n      swap(nums, i, j);\n      i++;\n      j--;\n    }\n  }\n  helper(nums, start, j);\n  helper(nums, i, end);\n}\n\n/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar sortArray = function (nums) {\n  helper(nums, 0, nums.length - 1);\n  return nums;\n};\n"
         }
     ]
 },
@@ -10753,6 +10753,37 @@
         }
     ]
 },
+"find-the-town-judge":{
+    "id": "997",
+    "name": "find-the-town-judge",
+    "pre": [
+        {
+            "text": "图",
+            "link": null,
+            "color": "green"
+        }
+    ],
+    "keyPoints": [
+        {
+            "text": "将问题抽象为图，问题转为求图的入度和出度",
+            "link": null,
+            "color": "blue"
+        }
+    ],
+    "companies": [],
+    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/997.find-the-town-judge.md",
+    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/997.find-the-town-judge.md",
+    "code": [
+        {
+            "language": "py",
+            "text": "\n\nclass Solution:\n     def findJudge(self, N, trust):\n        in_degree = [0] * (N + 1)\n        out_degree = [0] * (N + 1)\n        for a, b in trust:\n            in_degree[b] += 1\n            out_degree[a] += 1\n        for i in range(1, N + 1):\n            if in_degree[i] == N - 1 and out_degree[i] == 0:\n                return i\n        return -1\n\n"
+        },
+        {
+            "language": "py",
+            "text": "\nclass Solution:\n     def findJudge(self, N, trust):\n        count = [0] * (N + 1)\n        for i, j in trust:\n            count[i] -= 1\n            count[j] += 1\n        for i in range(1, N + 1):\n            if count[i] == N - 1:\n                return i\n        return -1\n"
+        }
+    ]
+},
 "max-consecutive-ones-iii":{
     "id": "1004",
     "name": "max-consecutive-ones-iii",

src/utils.js

@@ -331,3 +331,15 @@ export function getColor(text) {
   for (const c of text) ans += c.charCodeAt();
   return COLORS[ans % COLORS.length];
 }
+
+export const addStyle = (css) => {
+  const style = document.createElement("link");
+  try {
+    style.innerHTML = css;
+  } catch (e) {
+    console.log(e);
+    style.styleSheet.cssText = css;
+  }
+  const head = document.getElementsByTagName("head")[0];
+  head.appendChild(style);
+};

src/zen/zenMode.js

@@ -5,8 +5,8 @@ const leetCodeLogo =
   "https://static.leetcode-cn.com/cn-mono-assets/production/main/assets/favicon-notification-32x32.3f045777.png";
 
 function findHeader() {
-  const tag = document.querySelector("#new-ft");
-  return tag.parentElement.parentElement;
+  const tag = document.querySelector("#lc-home");
+  return tag.children[0].children[0];
 }
 
 function findSider() {