![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeeCode
BIN_CUH
这个作者很懒,什么都没留下…
展开
-
LeeCode And Two Numbers
public class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { if(l1 == null) return l2; if(l2 == null) return l1; int carry = 0;原创 2017-06-27 00:13:55 · 192 阅读 · 0 评论 -
LeeCode Longest Substring Without Repeating Characters
public int lengthOfLongestSubstring(String s) { int length = s.length(); if(length == 0) return 0; int p=0; int q=1; int max = 1; int isEqua原创 2017-06-28 00:26:40 · 137 阅读 · 0 评论 -
LeeCode Median of Two Sorted Arrays
public class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int length1 = nums1.length;int length2 = nums2.length;int length = length1 + length2;ArrayL原创 2017-07-07 00:32:17 · 154 阅读 · 0 评论 -
LeeCode Longest Palindromic Substring
public class Solution { public String longestPalindrome(String s) { boolean table[][] = new boolean[s.length()][s.length()]; int resI = 0; int len = 1; int maxLen = 1;原创 2017-07-30 15:35:09 · 160 阅读 · 0 评论 -
LeeCode ZigZag Conversion
public class Solution { public String convert(String s, int numRows) { if(s == null || s.length()==0 || numRows return ""; if(numRows == 1) return s; S原创 2017-08-08 22:52:49 · 153 阅读 · 0 评论 -
LeeCode String to Integer (atoi)
class Solution { public int myAtoi(String str) { str = str.trim(); if(str == null || str.length() == 0) return 0; int length = str.length(); int isNegative =1; in原创 2017-08-29 17:24:00 · 243 阅读 · 0 评论