leetcode笔记 2. Add Two Numbers & 3. Longest Substring Without Repeating Characters

之前太忙了。。。断更了N天。。。继续刷题
leetcode刷题26天
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.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    	ListNode p = new ListNode(0);
    	int tempVal = 0;
    	ListNode head = p;
    	int flag = 0;
    	while(l1 != null || l2 != null || flag!=0) {
    		tempVal = 0;
    		if(l1 != null) {
    			tempVal = tempVal + l1.val;
    			l1 = l1.next;
    		}
    		if(l2 != null) {
    			tempVal = tempVal + l2.val;
    			l2 = l2.next;
    		}
    		tempVal = tempVal + flag;
    		//System.out.println(tempVal);
    		ListNode tempNode = new ListNode(tempVal%10);
    		flag = tempVal / 10;
    		//System.out.println(flag);
    		p.next = tempNode;
    		p = p.next;
    		
    		
    	}
    	return head.next;
    }
}

3. Longest Substring Without Repeating Characters
   Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.
Example 2:

Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.
Example 3:

Input: “pwwkew”
Output: 3
Explanation: The answer is “wke”, with the length of 3.
Note that the answer must be a substring, “pwke” is a subsequence and not a substring.

class Solution {
    public int lengthOfLongestSubstring(String s) {
    	if (s.length()==0) return 0;
        HashMap<Character, Integer> map = new HashMap<Character, Integer>();
        int i,j=0;
        int res = 0;
        for(i = 0 ;i<s.length();i++) {
        	if(map.containsKey(s.charAt(i))) {
        		j = Math.max(j, map.get(s.charAt(i))+1);
        	}
        	map.put(s.charAt(i), i);
        	res = Math.max(res,i-j+1);
        }
        return res;
    }
}