Algorithm
1. Two Sum
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.
答：
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] answer = new int[2];
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; ++i){
map.put(nums[i], i);
}
for (int i = 0; i < nums.length; ++i){
int b = target - nums[i];
if (map.containsKey(b) && i != map.get(b))
return new int[]{i, map.get(b)};
}
return answer;
}
}
Review
How Browsers Work: Behind the scenes of modern web browsers - HTML5 Rocks
Learn how the browser works, but I need more time to finish this
TIP
在浏览器前端打开跨域链接，需要传递参数时，使用Windows.name和postMessage（）
Share
最近开始学习VUE，上述文章是VUE作者建议的新手学习VUE的顺序，下一阶段的学习以VUE为主
