摘要: https://leetcode.com/problems/ransom-note/#/description 阅读全文
posted @ 2017-04-19 11:11 Sempron2800+ 阅读(173) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/minimum-moves-to-equal-array-elements/#/description 阅读全文
posted @ 2017-04-19 11:10 Sempron2800+ 阅读(119) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public int FindContentChildren(int[] g, int[] s) { var listg = g.OrderBy(x => x).ToList(); var lists = s.OrderBy(x => x).ToLis 阅读全文
posted @ 2017-04-19 11:09 Sempron2800+ 阅读(111) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public int[] TwoSum(int[] numbers, int target) { Dictionary<int, int> dic = new Dictionary<int, int>(); int count = numbers.Co 阅读全文
posted @ 2017-04-19 11:08 Sempron2800+ 阅读(123) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/relative-ranks/#/description 阅读全文
posted @ 2017-04-19 11:07 Sempron2800+ 阅读(143) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/minimum-absolute-difference-in-bst/#/description 阅读全文
posted @ 2017-04-19 11:06 Sempron2800+ 阅读(122) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public void MoveZeroes(int[] nums) { int index = 0; for (int i = 0; i < nums.Length; i++) { //[0, 1, 0, 3, 12] //[1, 3, 12, 0, 阅读全文
posted @ 2017-04-19 11:06 Sempron2800+ 阅读(138) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/construct-the-rectangle/#/description 阅读全文
posted @ 2017-04-19 11:04 Sempron2800+ 阅读(115) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/longest-uncommon-subsequence-i/#/description 阅读全文
posted @ 2017-04-19 11:04 Sempron2800+ 阅读(127) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/add-digits/#/description 阅读全文
posted @ 2017-04-19 11:03 Sempron2800+ 阅读(105) 评论(0) 推荐(0) 编辑