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].

this is a first blog.

It's a very exciting time

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

1
2
3
4
5

public void start(){
  while(true){
      System.out.println("struggle！");
  }
}

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.

2019-10-30 星期三 十月初三己亥年 【猪年】甲戌月 庚子日 成都天气：晴

今日生辰。

回想这一年，有些事情过的跟电视剧一样。