摘要: https://leetcode.com/problems/student-attendance-record-i/#/description 阅读全文
posted @ 2017-04-19 11:30 Sempron2800+ 阅读(167) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/reverse-string-ii/#/description 阅读全文
posted @ 2017-04-19 11:29 Sempron2800+ 阅读(168) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/number-of-boomerangs/#/description 阅读全文
posted @ 2017-04-19 11:28 Sempron2800+ 阅读(240) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public int MissingNumber(int[] nums) { var list = nums.OrderBy(x => x).ToList(); var preNum = 0; foreach (var l in list) { if 阅读全文
posted @ 2017-04-19 11:28 Sempron2800+ 阅读(145) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public int[] Intersect(int[] nums1, int[] nums2) { var len1 = nums1.Length; var len2 = nums2.Length; var list = new List<int>( 阅读全文
posted @ 2017-04-19 11:27 Sempron2800+ 阅读(123) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/reverse-linked-list/#/description 简化的代码: 补充一个python的实现: 阅读全文
posted @ 2017-04-19 11:25 Sempron2800+ 阅读(148) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/binary-watch/#/description 阅读全文
posted @ 2017-04-19 11:24 Sempron2800+ 阅读(191) 评论(0) 推荐(0) 编辑
摘要: public class Solution { private int ChangeToInt(char c) { var number = 0; string s = c.ToString(); switch (s) { case "I": number = 1; break; case "V": 阅读全文
posted @ 2017-04-19 11:24 Sempron2800+ 阅读(149) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public bool ContainsDuplicate(int[] nums) { var list = nums.Distinct(); if (list.Count() == nums.Length) { return false; } els 阅读全文
posted @ 2017-04-19 11:23 Sempron2800+ 阅读(153) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/longest-palindrome/#/description 阅读全文
posted @ 2017-04-19 11:22 Sempron2800+ 阅读(108) 评论(0) 推荐(0) 编辑