liuqinh2s

# coding=utf-8

import requests
import time
import os
import json
import queue
import threading
import tushare as ts

liuqinh2s

idString=`ipfs id`
str="ID\": \""
subIdStr=${idString#*$str}
str1="\","
subIdStr1=${subIdStr%%$str1*}
echo $subIdStr1
sed -i "" "/root: / s/\/ipns\/$subIdStr1\//\//" _config.yml
sed -i "" "/url: / s/http:\/\/ipfs.io\/ipns\/$subIdStr1/http:\/\/liuqinh2s.github.io/" _config.yml
hexo clean
hexo g -d

liuqinh2s

/************************************************
 * 
 *                 全局变量
 *
 * 1. LOG 相关变量和函数
 * 2. 延时函数，控制点击速度，寻找最佳的速度，避免被支付宝限制
 * 3. 结束函数，自定义结束时候要执行的动作
 * 2. 路径和文件相关变量和函数
 *
 ************************************************/

liuqinh2s

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class JsonParser {
    private String json;
    private int index = 0;
    private Map<Character, Boolean> numChars = new HashMap<>();

liuqinh2s

#include<iostream>
#include<stack>

using namespace std;

struct ListNode{
    int value;
    ListNode* pNext;
};

liuqinh2s

public class Solution {

    public void partition(int[] array) {
        if (array == null || array.length <= 1) {
            return;
        }
        int index1 = 0;
        int index2 = 0;
        int index3 = 0;
        for (int i = 0; i < array.length; i++) {

liuqinh2s

public class Solution {

    public ListNode Merge(ListNode list1,ListNode list2) {
        if(list1==null){
            return list2;
        }
        if(list2==null){
            return list1;
        }
        ListNode node = new ListNode(0);

liuqinh2s

import java.util.ArrayList;

public class Solution {

    public boolean HasSubtree(TreeNode root1,TreeNode root2) {
        boolean result = false;
        if(root1!=null && root2!=null){
            result = doesTree1HaveTree2(root1, root2);
            if(!result){
                result = HasSubtree(root1.left, root2);

liuqinh2s

import com.alibaba.fastjson.JSONArray;
import com.alibaba.fastjson.JSONObject;

import java.util.ArrayList;
import java.util.Iterator;

public class Solution {

    public static void main(String[] args) {
        Solution solution = new Solution();

liuqinh2s

import java.util.ArrayList;
import java.util.Arrays;

public class Solution {

    public void insert(ArrayList<Integer> heap, int val){
        heap.add(val);
        update(heap, heap.size()-1);
    }