feat: trie 模板，复制测试用例增加更多的情况,zen mode

lucifer · lucifer · commit bdfca0dadf86 · 2020-12-13T19:08:02.000+08:00
diff --git a/leetcode-cheat.zip b/leetcode-cheat.zip
diff --git a/public/manifest.json b/public/manifest.json
@@ -2,7 +2,7 @@
   "manifest_version": 2,
   "name": "leetcode cheatsheet",
   "description": "刷题小助手，made by 力扣加加",
-  "version": "0.3.0",
+  "version": "0.3.2",
   "browser_action": {
     "default_popup": "index.html",
     "default_title": "力扣加加"
diff --git a/src/App.js b/src/App.js
@@ -12,12 +12,12 @@ import {
   LEETCODE_URL,
   CONTRIBUTE_PROGRAMMING_LANGUAGE_URL,
 } from "./constant/index";
-import TestCase from "./testCase";
+// import TestCase from "./testCase";
 import ProblemDetail from "./Detail";
 import TagOrLink from "./TagOrLink";
 import tempaltes from "./codeTemplates/index";
 import Codes from "./codes";
-import { bfs } from "./utils";
+// import { bfs } from "./utils";
 // import drawTree from "canvas-binary-tree";
 import "antd/dist/antd.css";
 import "./App.css";
@@ -173,8 +173,6 @@ function App() {
               </Button>
             ))}
 
-          <TestCase />
-
           <div style={page === "" ? {} : { display: "none" }}>
             <h2 style={{ display: "flex", justifyContent: "center" }}>
               代码模板
diff --git a/src/codeTemplates/trie.js b/src/codeTemplates/trie.js
@@ -1,5 +1,207 @@
 import treeLogo from "../imgs/tree.svg";
 
+const cppCode = `
+struct TrieNode {
+  TrieNode *children[26];
+  bool isEnd;
+  TrieNode(bool end=false) {
+      isEnd = end;
+      memset(children, 0, sizeof(children));
+  }
+};
+
+class Trie {
+private:
+  TrieNode *root;
+  
+  TrieNode* findString(string word) {
+      TrieNode *p = root;
+      for (size_t i=0; i<word.size(); i++) {
+          int index = word[i] - 'a';
+          if(p->children[index] == nullptr)
+              return nullptr;
+          p = p->children[index];
+      }
+      return p;
+  }
+  
+  void clear(TrieNode *root) {
+      for (size_t i = 0; i < 26; i ++) 
+          if (root->children[i])
+              clear(root->children[i]);
+      delete root;
+  }
+public:
+  /** Initialize your data structure here. */
+  Trie() {
+      root = new TrieNode();
+  }
+  
+  ~Trie() {
+      clear(root);
+  }
+  
+  /** Inserts a word into the trie. */
+  void insert(string word) {
+      TrieNode *p = root;
+      for(size_t i=0; i<word.size(); i++) {
+          int index = word[i] - 'a';
+          if (!p->children[index])
+              p->children[index] = new TrieNode();
+          p = p->children[index];
+      }
+      p->isEnd = true;
+  }
+  
+  /** Returns if the word is in the trie. */
+  bool search(string word) {
+      TrieNode *p = findString(word);
+      return p != nullptr && p->isEnd;
+  }
+  
+  /** Returns if there is any word in the trie that starts with the given prefix. */
+  bool startsWith(string prefix) {
+      TrieNode *p = findString(prefix);
+      return p != nullptr;
+  }
+};
+
+/**
+* Your Trie object will be instantiated and called as such:
+* Trie* obj = new Trie();
+* obj->insert(word);
+* bool param_2 = obj->search(word);
+* bool param_3 = obj->startsWith(prefix);
+*/
+`;
+const goCode = `
+type Node struct {
+	isWord bool
+	next map[byte]*Node
+}
+
+func NewNode(isWord bool) *Node {
+	return &Node{isWord: isWord, next: make(map[byte]*Node)}
+}
+
+type Trie struct {
+	root *Node
+}
+
+//func NewTrie() *Trie {
+//	return &Trie{root: NewNode(false)}
+//}
+
+/** Initialize your data structure here. */
+func Constructor() Trie {
+	return Trie{root: NewNode(false)}
+}
+
+
+/** Inserts a word into the trie. */
+func (t *Trie) Insert(word string)  {
+	cur := t.root
+	for i := 0; i < len(word); i++ {
+		c := word[i]
+		_, ok := cur.next[c]
+		if !ok { // 
+			cur.next[c] = NewNode(false)
+		} 
+		cur = cur.next[c]
+	}
+	if !cur.isWord { // 标记为单词
+		cur.isWord = true
+	}
+}
+
+
+/** Returns if the word is in the trie. */
+func (t *Trie) Search(word string) bool {
+	cur := t.root
+	for i := 0; i < len(word); i++ {
+		c := word[i]
+		v, ok := cur.next[c]
+		if !ok {
+			return false
+		}
+		cur = v
+	}
+	return cur.isWord
+}
+
+
+/** Returns if there is any word in the trie that starts with the given prefix. */
+func (t *Trie) StartsWith(prefix string) bool {
+	cur := t.root
+	for i := 0; i < len(prefix); i++ {
+		c := prefix[i]
+		v,ok := cur.next[c]
+		if !ok {
+			return false
+		}
+		cur = v
+	}
+	return true
+}
+`;
+
+const javaCode = `
+class Trie {
+
+  class TireNode {
+      boolean isEnd = false;
+      TireNode[] next = new TireNode[26];
+      TireNode() {} 
+  }
+
+  private TireNode root;
+
+  /** Initialize your data structure here. */
+  public Trie() {
+      root = new TireNode();
+  }
+  
+  /** Inserts a word into the trie. */
+  public void insert(String word) {
+      TireNode node = root;
+      for (char ch : word.toCharArray()) {
+          if (node.next[ch-'a'] == null) {
+              node.next[ch-'a'] = new TireNode();
+          }
+          node = node.next[ch-'a'];
+      }
+      node.isEnd = true;
+  }
+  
+  /** Returns if the word is in the trie. */
+  public boolean search(String word) {
+      TireNode node = root;
+      for (char ch : word.toCharArray()) {
+          if (node.next[ch-'a'] == null) return false;
+          node = node.next[ch-'a'];
+      }
+      return node.isEnd;
+  }
+  
+  /** Returns if there is any word in the trie that starts with the given prefix. */
+  public boolean startsWith(String prefix) {
+      TireNode node = root;
+      for (char ch : prefix.toCharArray()) {
+          if (node.next[ch-'a'] == null) return false;
+          node = node.next[ch-'a'];
+      }
+      return true;
+  }
+}
+
+/**
+* Your Trie object will be instantiated and called as such:
+* Trie obj = new Trie();
+* obj.insert(word);
+* boolean param_2 = obj.search(word);
+* boolean param_3 = obj.startsWith(prefix);
+*/
+`;
 export default {
   title: "前缀树",
   logo: treeLogo,
@@ -160,6 +362,18 @@ class Trie:
            */
                   `,
         },
+        {
+          language: "cpp",
+          text: cppCode,
+        },
+        {
+          language: "go",
+          text: goCode,
+        },
+        {
+          language: "java",
+          text: javaCode,
+        },
       ],
     },
   ],
diff --git a/src/contentScript.js b/src/contentScript.js
@@ -1,15 +1,24 @@
 import { message } from "antd";
 // import "./content.css";
 import { copyToClipboard, 不讲武德 } from "./utils";
+import zenAble from "./zen/zenMode";
+
+// if (testCase[i] === '"') {
+//   while (i < testCase.length && testCase[i] !== '"') {
+//     stack.push(testCase[i]);
+//   }
+//   stack.push("\n");
+// } else
 
 // testcase eg: `bottom = "BCD", allowed = ["BCG", "CDE", "GEA", "FFF"], c = [1,2,3], d = 2`
 function normalize(testCase) {
-  testCase = testCase.replace(/\n/g, "").replace("&nbsp;", "");
-  console.log(testCase);
+  testCase = testCase.trim().replace(/\n/g, "").replace("&nbsp;", "");
+
   // 单一参数
+  // console.log(testCase);
   if (!testCase.includes("=")) {
     // 数组直接返回
-    if (testCase.includes("[")) {
+    if (testCase.includes("[") || testCase.includes('"')) {
       return testCase;
     } else {
       // 输入: 3, 2, 0, 0
@@ -58,6 +67,14 @@ function normalize(testCase) {
   return stack.join("");
 }
 
+function extractTestCase(text, prefix) {
+  const testCase = text.match(new RegExp(`${prefix}(.*)输出`, "s"));
+  if (!testCase || testCase.length <= 1) {
+    return text.match(new RegExp(`${prefix}(.*)$`, "s"));
+  }
+  return testCase;
+}
+
 function getProviedTestCases() {
   const possibleTags = ["pre", "p"];
   const possiblePrefixs = ["输入：", "输入:"];
@@ -68,12 +85,10 @@ function getProviedTestCases() {
     for (let prefix of possiblePrefixs) {
       for (var i = 0; i < pres.length; ++i) {
         if (pres[i].innerText.includes(prefix)) {
-          const testcase = pres[i].innerText.match(
-            new RegExp(`${prefix}(.*)输出`, "s")
-          );
-          console.log(testcase);
-          if (testcase.length <= 1) {
-            return 不讲武德();
+          const testcase = extractTestCase(pres[i].innerText, prefix);
+          if (!testcase || testcase.length <= 1) {
+            不讲武德();
+            return [];
           }
           ans.push(normalize(testcase[1]));
         }
@@ -100,15 +115,20 @@ function insertButton() {
         });
       };
       buttons[i].parentElement.prepend(copyButton);
-      break;
+      return true;
     }
   }
+  return false;
 }
 let inserted = false;
 const timerId = setInterval(() => {
   if (inserted) return clearInterval(timerId);
-  insertButton();
-  inserted = true;
+  if (insertButton()) {
+    window.location.title = "";
+    inserted = true;
+    // 可进入禅定模式
+    zenAble();
+  }
 }, 1000);
 
 // class Main extends React.Component {
diff --git a/src/testCase.js b/src/testCase.js
@@ -252,11 +252,10 @@ export default function TestCase() {
         type="primary"
         onClick={() => {
           t().then((elements) => {
-            alert(JSON.stringify(elements));
             const cases = getProviedTestCases(elements);
             const ans = cases.map(normalize).join("\n");
             console.log(cases, ans);
-            alert(elements);
+
             if (ans) {
               if (copyToClipboard(ans)) message.success("复制成功");
             }
diff --git a/src/zen/zenMode.js b/src/zen/zenMode.js
