12 2015 档案

[LeetCode] 3. Longest Substring Without Repeating Characters
摘要：首先看一下只需要return 长度的解法： public class Solution { public int lengthOfLongestSubstring(String s) { /*** * Basic idea: N(o^2): for each character, continue 阅读全文

posted @ 2015-12-10 13:06 codingEskimo 阅读(130) 评论(0) 推荐(0)

[LeetCode] 2. Add Two Numbers
摘要：/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solu 阅读全文

posted @ 2015-12-09 14:10 codingEskimo 阅读(166) 评论(0) 推荐(0)

[LeetCode] 1. Two Sum
摘要：public class Solution { public int[] twoSum(int[] nums, int target) { /* Basic idea: Load the array into a hashMap with the value of each array elemen 阅读全文

posted @ 2015-12-09 11:34 codingEskimo 阅读(115) 评论(0) 推荐(0)

Two Strings Are Anagrams
摘要：public class Solution { /** * @param s: The first string * @param b: The second string * @return true or false */ public boolean... 阅读全文

posted @ 2015-12-01 13:54 codingEskimo 阅读(131) 评论(0) 推荐(0)

[LeetCode] 206. Reverse Linked List
摘要：/** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; * this.next = null; * } * 阅读全文

posted @ 2015-12-01 09:54 codingEskimo 阅读(117) 评论(0) 推荐(0)

Singleton
摘要：class Solution { /** * @return: The same instance of this class every time */ //http://www.cnblogs.com/EdwardLiu/p/4443230.html ... 阅读全文

posted @ 2015-12-01 09:35 codingEskimo 阅读(151) 评论(0) 推荐(0)

导航