leetcode983
摘要：public class Solution { public int MincostTickets(int[] days, int[] costs) { int weeklyStart = 0; int monthlyStart = 0; int[] dp = new int[days...
阅读全文
posted @
2019-01-28 18:35
Sempron2800+
阅读(250)
推荐(0) 编辑
leetcode984
摘要：public class Solution { private string M1(int A, int B) { StringBuilder sb = new StringBuilder(); int groupA = A / 2; int freeA = A % 2; ...
阅读全文
posted @
2019-01-28 14:53
Sempron2800+
阅读(120)
推荐(0) 编辑
leetcode970
摘要：public class Solution { public IList PowerfulIntegers(int x, int y, int bound) { var list = new List(); for (int i = 0; i a).ToList(); ...
阅读全文
posted @
2019-01-22 11:02
Sempron2800+
阅读(119)
推荐(0) 编辑
leetcode976
摘要：public class Solution { public int LargestPerimeter(int[] A) { var list = A.OrderByDescending(x => x).ToList(); var length = list.Count; if (le...
阅读全文
posted @
2019-01-22 10:25
Sempron2800+
阅读(91)
推荐(0) 编辑
leetcode977
摘要：public class Solution { public int[] SortedSquares(int[] A) { return A.Select(x => x * x).ToList().OrderBy(x => x).ToArray(); } } Java版代码： 1 class Sol
阅读全文
posted @
2019-01-22 10:06
Sempron2800+
阅读(80)
推荐(0) 编辑
leetcode973
摘要：public class POINT { public int X; public int Y; public int Z; } public class Solution { public int[][] KClosest(int[][] points, int K) { ...
阅读全文
posted @
2019-01-22 09:55
Sempron2800+
阅读(114)
推荐(0) 编辑
leetcode965
摘要：public class Solution { List list = new List(); private void postTree(TreeNode root) { if (root != null) { list.Add(root.val); ...
阅读全文
posted @
2019-01-08 12:38
Sempron2800+
阅读(126)
推荐(0) 编辑
