Leetcode_1~10

第一题：

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.

例如：

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

	public static int[] twoSum(int[] nums, int target){
		Map
   
   
    
     map=new HashMap
    
    
     
     ();
		for(int i=0; i
     
     
    
    
   
   

第二题：

You are given two linked lists representing two non-negative numbers. 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.

例如：

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8`

解答：

	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode dummyHead=new ListNode(0);
		ListNode p=l1, q=l2, curr=dummyHead;
		int carry=0;
		while(p != null  || q != null){
			int x=(p!=null) ? p.val : 0;
			int y=(q!=null) ? q.val : 0;
			int sum=carry+x+y;
			carry= sum / 10;
			curr.next=new ListNode(sum % 10);
			curr=curr.next;
			if(p != null) p=p.next;
			if(q != null) q=q.next;
		}
		if(carry>0){
			curr.next=new ListNode(carry);
		}
		return dummyHead.next;
	}