leetcode
luppy01
这个作者很懒,什么都没留下…
展开
-
LeetCode 2
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public List原创 2017-05-21 22:18:40 · 2378 阅读 · 0 评论 -
LeetCode 1
public int[] twoSum(int[] nums, int target) { if (nums == null || nums.length == 0) { return null; } Map map = new HashMap(); int complement = 0; for (int i = 0; i nums.length;原创 2017-03-10 15:59:46 · 511 阅读 · 0 评论