feat: 复杂度速查

Author: lucifer

src/App.js

@@ -20,6 +20,7 @@ import checkUpdate from "./checkUpdates";
 import "antd/dist/antd.css";
 import "./App.css";
 import CodeTemplates from "./codeTemplates/codeTemplate";
+import ComplexityRating from './complexityRating/index'
 // import { data as a } from "./db/binary-tree";
 
 const { problems, selected } = db;
@@ -195,6 +196,9 @@ function App() {
           <TabPane key="app" tab="代码模板">
             <CodeTemplates page={page} tempaltes={tempaltes}></CodeTemplates>
           </TabPane>
+          <TabPane key="complexityRating" tab="复杂度速查">
+            <ComplexityRating />
+          </TabPane>
           <TabPane key="roadmap" tab="学习路线">
             <Roadmap />
           </TabPane>

src/codeTemplates/codeTemplate.jsx

@@ -11,9 +11,9 @@ import {
 const { TabPane } = Tabs;
 const { Panel } = Collapse;
 
-export default function CodeTemplate({ page, tempaltes }) {
+export default function CodeTemplate({ tempaltes }) {
   return (
-    <div style={page === "" ? {} : { display: "none" }}>
+    <div >
       <Tabs>
         {tempaltes.map((tempalte) => (
           <TabPane

src/complexityRating/index.jsx

@@ -0,0 +1,94 @@
+import React from "react";
+import { Button, Table } from "antd";
+
+import "./index.less";
+
+// | 数据规模 | 算法可接受时间复杂度 |
+// | -------- | -------------------- |
+// | <= 10    | $O(n!)$              |
+// | <=20     | $O(2^n)$             |
+// | <=100    | $O(n^4)$             |
+// | <=500    | $O(n^3)$             |
+// | <=2500   | $O(n^2)$             |
+// | <=10^6   | $O(n * logn)$        |
+// | <=10^7   | $O(n)$               |
+// | <=10^14  | $O(\sqrt{n})$        |
+// | -        | $O(logn)$            |
+
+const columns = [
+  {
+    key: "size",
+    dataIndex: "size",
+    title: "数据规模",
+    align: "center",
+  },
+  {
+    key: "complexity",
+    dataIndex: "complexity",
+    title: "算法可接受时间复杂度",
+    align: "center",
+    render: (t) => {
+      if (t === "O(sqrt(n))") return <img src={require("../imgs/sqrt.svg")} />;
+      return t;
+    },
+  },
+];
+
+const data = [
+  {
+    size: "<= 10",
+    complexity: "O(n!)",
+  },
+  {
+    size: "<= 20",
+    complexity: "O(2^n)",
+  },
+  {
+    size: "<= 100",
+    complexity: "O(n^4)",
+  },
+  {
+    size: "<= 500",
+    complexity: "O(n^3)",
+  },
+  {
+    size: "<= 2500",
+    complexity: "O(n^2)",
+  },
+  {
+    size: "<= 10^6",
+    complexity: "O(nlogn)",
+  },
+  {
+    size: "<= 10^7",
+    complexity: "n",
+  },
+  {
+    size: "<= 10^14",
+    complexity: "O(sqrt(n))",
+  },
+  {
+    size: "-",
+    complexity: "O(logn)",
+  },
+];
+
+export default function ComplexityRating({}) {
+  return (
+    <div>
+      <Button
+        type="link"
+        href="https://lucifer.ren/blog/2020/12/21/shuati-silu3/"
+        target="_blank"
+      >
+        不懂为什么？点这里
+      </Button>
+
+      <div>
+        <img src="https://tva1.sinaimg.cn/large/0081Kckwly1gm6x8pzqotj30ad03q3ye.jpg" />
+      </div>
+
+      <Table columns={columns} dataSource={data} />
+    </div>
+  );
+}

src/complexityRating/index.less

@@ -0,0 +1,13 @@
+.blockquote {
+  text-size-adjust: 100%;
+  line-height: 1.55em;
+  font-weight: 400;
+  border-radius: 6px;
+  color: #595959;
+  font-style: normal;
+  text-align: left;
+  box-sizing: inherit;
+  border-left: none;
+  border: 1px solid RGBA(64, 184, 250, 0.4);
+  background: RGBA(64, 184, 250, 0.1);
+}

src/contentScript.js

@@ -68,11 +68,14 @@ function normalize(testCase) {
 }
 
 function extractTestCase(text, prefix) {
-  const testCase = text.match(new RegExp(`${prefix}(.*)输出`, "s"));
-  if (!testCase || testCase.length <= 1) {
-    return text.match(new RegExp(`${prefix}(.*)$`, "s"));
+  const possiblePrefixs = ["输出", "返回", ""];
+  for (let tag of possiblePrefixs) {
+    const testCase = text.match(new RegExp(`${prefix}(.*)${tag}`, "s"));
+    if (testCase && testCase.length > 1) {
+      return testCase;
+    }
   }
-  return testCase;
+  return [];
 }
 
 function getProviedTestCases() {