monsterooo

/**
 * The first commented line is your dabblet’s title
 */

background: #f06;
background: linear-gradient(45deg, #f06, yellow);
min-height: 100%;

monsterooo

.container {
	display: flex;
}
.container div {
	width: 50px;
	background: gold;
	text-align: center;
	line-height: 50px;
}

monsterooo

/**
 * The first commented line is your dabblet’s title
 */
html,body {
	padding: 0;
	margin: 0;
}
.panel {
	transform: translateX(-100%);
	transition: transform 0.3s ease-out; 

monsterooo

.item {
	display: box;
	height: 300px;
	/*设置伸缩盒对象的子元素从上到下纵向排列*/
	/*box-orient: vertical;*/ /*简单说就是垂直排列*/
	/*设置伸缩盒对象的子元素从左到右水平排列*/
	/*box-orient: horizontal;*/ /*简单说就是水平排列*/
}
.list {
	background-color: gold;

monsterooo

.item {	
	display: box;
	height: 300px;	
	/*设置伸缩盒对象的子元素从上到下纵向排列*/
	/*box-orient: vertical;*/ 
	/*简单说就是垂直排列*/	
	/*设置伸缩盒对象的子元素从左到右水平排列*/
	box-orient: horizontal; /*简单说就是水平排列*/
	
	/*子元素从开始位置对齐*/

monsterooo

Fisher–Yates洗牌算法，它可是最优洗牌算法它不仅是无偏的，而且时间复杂度是O(n)，空间复杂度是O(1)，同时也非常容易实现，代码如下

function shuffle(array) {
  var n = array.length, t, i;
  while (n) {
    i = Math.random() * n-- | 0; // 0 ≤ i < n
    t = array[n];
    array[n] = array[i];
 array[i] = t;

monsterooo

const pick = (obj, keys) => {
  return keys.filter(key => obj.hasOwnProperty(key)).reduce((preValue, key) => {
    preValue[key] = obj[key];
    return preValue;
  }, {});
};

// var o = {
//   a: 1,
//   b: 2,

monsterooo

Remove MySQL completely

1. Open the Terminal

2. Use mysqldump to backup your databases

3. Check for MySQL processes with: ps -ax | grep mysql

4. Stop and kill any MySQL processes

5. Analyze MySQL on HomeBrew:

brew remove mysql

monsterooo

function getBodyScrollTop () { const el = document.scrollingElement || document.documentElement return el.scrollTop }

monsterooo

/**
 * 回文字符串判断
*/

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;