vigack

find -name "*.java" -print | xargs wc -l

vigack

"""
class Node:
    def __init__(self, data=None, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right
"""

def preOrder(root):
    pass

vigack

"""
基本思想：利用层序遍历，浮标法记录最大值
Node struct:
class Node:
    def __init__(self, data, left, right):
        self.data = data
        self.left = left
        self.right = right
"""

vigack

def isMonostoneInc(list):
  return all(list[i], list[i+1] for i in range(len(list)-1))

vigack

class Graph
    @adjlst
    @v
    @e

    def initialize(size)
        @adjlst = Array.new(size+1) { [] }
        @v = size
    end

vigack

  docker ps|awk '{if (NR!=1) print $1}'| xargs docker stop

vigack

public class Psychic {

    private static FuckRandom fuckRandom = new FuckRandom();

    static {
        fuckRandom.reverse(Math.random());
    }

    public static double guess(){
        return fuckRandom.nextDouble();

vigack

def travel(root):
    levels, level = [], [root]
    while root and level:
        levels.append([n.val for n in level])
        level = [k for n in level for k in (n.left, n.right) if k]
    return levels

vigack

cfg = []
ht = {}

class Token:
    def __init__(self, val, is_term):
        self.val = val
        self.is_term = is_term
    
    def __eq__(self, other):
        return (self.val, self.is_term) == (other.val, other.is_term)

vigack

class Solution:
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        nums.sort
        solutions = []
        d = {}
        inx = 0