leetcode
Jerry_Blighta
这个作者很懒,什么都没留下…
展开
-
leetcode-Two Sum
public int[] twoSum(int[] numbers, int target) { int x=0; int y=0; Map map = new HashMap(); for(int i=0;i<numbers.length;i++) { if(map.containsKey(target-numbers[i])) { x = i; y = map.get(target-numbe原创 2015-03-16 20:15:05 · 207 阅读 · 0 评论 -
leetcode-Longest Substring Without Repeating Characters
public class Solution { public int lengthOfLongestSubstring(String s) { Map map = new HashMap(); int max = 0; int length=0; int start = 0; for(int i=0;i<s.原创 2015-03-16 21:22:22 · 257 阅读 · 0 评论 -
leetcode-Add Two Numbers
public class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { boolean addOne = false; ListNode result = new ListNode(0); ListNode point = result;原创 2015-03-16 20:33:44 · 192 阅读 · 0 评论