Skip to content

Instantly share code, notes, and snippets.

Avatar
⚙️
不好好学习,只能。。。

Moody Wizmann Wizmann

⚙️
不好好学习,只能。。。
View GitHub Profile
View README.md

README


How to use

Paste the js code to Tampermonkey(Chrome) or Greasemonkey(Firefox). Paste the css code to Stylish, and set the matching url pattern as "https://workflowy.com/".

Open a new workflowy page, it works!

@Wizmann
Wizmann / workflowy-with-image.js
Last active Nov 30, 2020
workflowy-with-image.js
View workflowy-with-image.js
// ==UserScript==
// @name New Userscript
// @namespace http://tampermonkey.net/
// @version 0.1
// @description try to take over the world!
// @author You
// @match https://workflowy.com/*
// @grant none
// ==/UserScript==
/* jshint -W097 */
View KVTree.cc
#include "KVTree.hpp"
void TreeIterator::next() {
return;
}
bool TreeIterator::has_next() {
while (!_stack.empty() || _cur) {
if (_cur == nullptr) {
_cur = _stack.top();
@Wizmann
Wizmann / longest_suffix_match.md
Last active Aug 29, 2015
longest_suffix_match.md
View longest_suffix_match.md

最长后辍匹配 Max suffix match

Description

最长后辍匹配指的是在一个单词中,一个任意非后辍的子串与后辍的最长匹配。

如单词banana,其最长后辍匹配为:b"ana"na和ban"ana"。(引号内的部分即为匹配的部分)

所以,MaxSuffixMatch("banana") = 3

@Wizmann
Wizmann / continental divider.cc
Created Feb 22, 2015
continental divider.cc
View continental divider.cc
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define input(x) cin >> x
View gist:35ebc4da3b8c074a0fb3
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>
using namespace std;
@Wizmann
Wizmann / comma_matrix.cc
Last active Aug 29, 2015
comma_matrix.cc
View comma_matrix.cc
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define print(x) do {cout << x << endl;} while(0)
#define input(x) do {cin >> x;} while(0)
@Wizmann
Wizmann / 4834.cc
Created May 25, 2014
HDU 4834 - JZP Set
View 4834.cc
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define print(x) cout << x << endl
View DiscreteMap.cc
#include <cstdio>
#include <iostream>
#include <ctime>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>