Skip to content

Instantly share code, notes, and snippets.

View monsterooo's full-sized avatar
👋

monsterooo monsterooo

👋
View GitHub Profile
@monsterooo
monsterooo / index.html
Last active June 29, 2022 08:00
hello-react
<html>
<head>
<meta charset="UTF-8" />
<title>Hello World</title>
<script src="https://unpkg.com/react@17.0.2/umd/react.production.min.js"></script>
<script src="https://unpkg.com/react-dom@17.0.2/umd/react-dom.production.min.js"></script>
<script src="https://unpkg.com/@babel/standalone@7.13.12/babel.min.js"></script>
</head>
<body>
<div id="root"></div>
@monsterooo
monsterooo / dabblet.css
Last active November 4, 2020 09:30
Untitled
.box {
width: 30px;
height: 30px;
background: yellowgreen;
border: 10px solid #655;
outline: 5px dashed deeppink;
outline-offset: -8px;
border-radius: 30px;
}
" Specify a directory for plugins
call plug#begin('~/.vim/plugged')
Plug 'neoclide/coc.nvim', {'branch': 'release'}
Plug 'scrooloose/nerdtree'
"Plug 'tsony-tsonev/nerdtree-git-plugin'
Plug 'Xuyuanp/nerdtree-git-plugin'
Plug 'tiagofumo/vim-nerdtree-syntax-highlight'
Plug 'ryanoasis/vim-devicons'
Plug 'airblade/vim-gitgutter'
@monsterooo
monsterooo / .js
Last active August 9, 2023 03:23
monaco-syntax-php
// https://microsoft.github.io/monaco-editor/playground.html#extending-language-services-custom-languages
// Register a new language
monaco.languages.register({ id: 'mySpecialLanguage' });
// Register a tokens provider for the language
monaco.languages.setMonarchTokensProvider('mySpecialLanguage', {
tokenizer: {
root: [
// [/<\?((php)|=)?/, { token: '@rematch', switchTo: '@phpInSimpleState.root' }],
{ include: 'phpRoot' },
# 通过url获取qs参数
function getParameterByName(name, url) {
if (!url) url = window.location.href;
name = name.replace(/[\[\]]/g, '\\$&');
var regex = new RegExp('[?&]' + name + '(=([^&#]*)|&|#|$)'),
results = regex.exec(url);
if (!results) return null;
if (!results[2]) return '';
return decodeURIComponent(results[2].replace(/\+/g, ' '));
}
@monsterooo
monsterooo / gist:9b3d205b53cb995e2d444e2a2d8e3d8b
Created February 22, 2019 18:06
生成括号问题-卡特兰数
function generateBracket(res, str, left, right) {
if (left > right) return;
console.log(`str > ${str}, left > ${left}, right > ${right}`)
if (left > 0) {
generateBracket(res, str + '(', left - 1, right);
}
if (right > 0) {
generateBracket(res, str + ')', left, right - 1);
}
if (left === 0 && right === 0) {
@monsterooo
monsterooo / gist:0c7125d5985eea83b08f4d7d1cdecf69
Created February 13, 2019 15:22
算法练习-判断二叉树是否对称
/*
对称二叉树树
1
/ \
2 2
/ \ / \
4 8 8 4
*/
// 对称二叉树树
@monsterooo
monsterooo / gist:8c3e6f29bbfd848d95ea7e3126eb0fa2
Created February 13, 2019 14:03
算法练习-有序数组中求和为给定值得两个数
var nums = [1,2,3,6,8,11];
var target = 10;
function getTwoNumSum(nums, target) {
var i = 0, j = nums.length - 1;
while(i < j) {
if (nums[i] + nums[j] > target) {
j--;
} else if (nums[i] + nums[j] < target) {
i++;
@monsterooo
monsterooo / gist:ae6c4c904b67ddfa26f5b0eb0de23fc0
Created February 13, 2019 13:53
算法练习-求和为给定值得两个数
var nums = [1,2,3,6,8,11];
var target = 10;
// 暴力破解法 O(n^2)
function getTwoNumSumBruteForce(nums, target) {
for (var i = 0; i < nums.length; i++) {
for (var j = i + 1; j < nums.length; j++) {
if (nums[i] + nums[j] === target) {
return [i, j]
}
@monsterooo
monsterooo / gist:f5a90092ed28bd0a1061794c807e6f39
Last active February 13, 2019 13:53
算法练习-回文字符串判断
/**
* 回文字符串判断
*/
function isPalindrome(s) {
if (!s) return true;
var i = 0, j = s.length - 1;
for (; i < j; ++i, --j ) {
while (i < j && !isAlphaNumber(s[i])) ++i;
while(i < j && !isAlphaNumber(s[j])) --j;