摘要：
https://leetcode.com/problems/nth-digit/#/description 阅读全文
摘要：
https://leetcode.com/problems/intersection-of-two-linked-lists/#/description 补充一个python的实现： 阅读全文
摘要：
public class Solution { public string LongestCommonPrefix(string[] strs) { if (strs.Length == 0) { return ""; } else if (strs.Length == 1) { return st 阅读全文
摘要：
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 阅读全文
摘要：
C#的实现： public class Solution { public int LengthOfLastWord(string s) { s = s.Trim(); if (s.Length == 0 || s.Trim().Length == 0) { return 0; } var len 阅读全文
摘要：
https://leetcode.com/problems/remove-linked-list-elements/#/description 阅读全文
摘要：
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 阅读全文
摘要：
https://leetcode.com/problems/contains-duplicate-ii/#/description 阅读全文