# 单例模式

## 饿汉式：线程安全，但效率比较低

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.

# query

## 全文查询

1. QueryBuilders.matchQuery(“filed”,”value”).operator(Operator.AND); // 对查询的语句进行分词，分词后的词任意一个匹配doc都能查出来 term query 查询的是词项<分词后的> （eg：Java编程思想） Java编程 term query 不能查到 分词后变成（Java 编程 思想） matchQuery能查到
2. QueryBuilders.matchPhraseQuery(“field”,”value”);
对value进行分词，可以自定义分词器,满足两个条件才能被搜到：
• 分词后的所有词项都要匹配原字段
• 顺序还需要一致

# description

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

# Hello blog

### this is a first blog.

It's a very exciting time

• make a plan
• execute
• have a harvest
• come on

:D 一言句子获取中...