leetcode
张天航
这个作者很懒,什么都没留下…
展开
-
[LeetCode] 4 Median of Two Sorted Arrays
package pack4;import java.util.Arrays;public class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int len = nums1.length + nums2.length; if(len%原创 2015-07-12 20:14:42 · 292 阅读 · 0 评论 -
【LeetCode】2 Add Two Numbers
/** * You are given two linked lists representing two non-negative numbers. The * digits are stored in reverse order and each of their nodes contain a single * digit. Add the two numbers and return原创 2015-07-05 12:21:23 · 393 阅读 · 0 评论 -
[LeetCode] 4 Find the kth smallest element in two sorted array
Find the kth smallest element in two sorted array public int kthSmallestElem(int[] num1,int[] num2,int k){ /* * 1) num1 length = 0 , num2 length > 0 * 2) num2 length = 0 , num原创 2015-07-12 20:03:12 · 919 阅读 · 0 评论 -
【LeetCode】3 Longest Substring Without Repeating Characters
Solution1 public class Solution { public int lengthOfLongestSubstring(String s) { boolean []exist = new boolean[256]; int i=0,maxLen = 0; for(int j=0;j<s.length();j++)原创 2015-07-07 22:38:36 · 371 阅读 · 0 评论