LeetCode
文章平均质量分 71
RiqueZhang
这个作者很懒,什么都没留下…
展开
-
[LeetCode]Longest Substring Without Repeating Characters
题目:点击打开链接public class Solution { public int lengthOfLongestSubstring(String s) { if (null == s) { return 0; } int length = s.length(); if (1原创 2015-10-08 16:38:13 · 286 阅读 · 0 评论 -
[LeetCode]Median of Two Sorted Arrays
题目:点击打开链接public class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { if ((null == nums1) || (null == nums2)) { return 0; } int t原创 2015-10-08 16:39:28 · 228 阅读 · 0 评论 -
[LeetCode]Two Sum
题目:点击打开链接public class Solution { public int[] twoSum(int[] nums, int target) { if (null == nums) { return null; } int length = nums.length; if (0原创 2015-10-08 16:13:41 · 232 阅读 · 0 评论 -
[LeetCode]Add Two Numbers
题目:点击打开链接/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public Li原创 2015-10-08 16:37:10 · 247 阅读 · 0 评论 -
[LeetCode]Longest Palindromic Substring
题目:点击打开链接public class Solution { public String longestPalindrome(String s) { if (null == s) { return null; } int length = s.length(); if原创 2015-10-09 08:32:21 · 189 阅读 · 0 评论 -
[LeetCode]ZigZag Conversion
题目:点击打开链接public class Solution { public String convert(String s, int numRows) { if (1 >= numRows) { return s; } int length = s.length();原创 2015-10-09 08:34:24 · 233 阅读 · 0 评论