摘要：
https://leetcode.com/problems/intersection-of-two-linked-lists/#/description 补充一个python的实现： 阅读全文
posted @ 2017-04-25 14:41
Sempron2800+
阅读(199)
评论(0)
推荐(0)
摘要：
public class Solution { public string LongestCommonPrefix(string[] strs) { if (strs.Length == 0) { return ""; } else if (strs.Length == 1) { return st 阅读全文
posted @ 2017-04-25 13:07
Sempron2800+
阅读(140)
评论(0)
推荐(0)
摘要：
public class Solution { public string AddBinary(string a, string b) { var list = new List<string>(); if (a.Length > b.Length) { //补充b的长度 var dif = a.L 阅读全文
posted @ 2017-04-25 12:02
Sempron2800+
阅读(128)
评论(0)
推荐(0)
摘要：
C#的实现： public class Solution { public int LengthOfLastWord(string s) { s = s.Trim(); if (s.Length == 0 || s.Trim().Length == 0) { return 0; } var len 阅读全文
posted @ 2017-04-25 11:38
Sempron2800+
阅读(111)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/remove-linked-list-elements/#/description 阅读全文
posted @ 2017-04-25 11:27
Sempron2800+
阅读(116)
评论(0)
推荐(0)
摘要：
public class Solution { public void Merge(int[] nums1, int m, int[] nums2, int n) { //for (int i = 0; i < n; i++) //{ //nums1[m++] = nums2[i]; //} //n 阅读全文
posted @ 2017-04-25 10:21
Sempron2800+
阅读(120)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/contains-duplicate-ii/#/description 阅读全文
posted @ 2017-04-25 09:28
Sempron2800+
阅读(105)
评论(0)
推荐(0)
浙公网安备 33010602011771号