2020年1月17日
Leetcode1266. Minimum Time Visiting All Points
摘要： public int minTimeToVisitAllPoints(int[][] points) { int rowLength = points.length; //获取行数 int count = 0; for (int i = 0; i < rowLength - 1; i++) { in 阅读全文
posted @ 2020-01-17 02:27 一只桃子 阅读(137) 评论(0) 推荐(0)
Leetcode1313 Decompress Run-Length Encoded List(解压缩编码列表)
摘要： public int[] decompressRLElist(int[] nums) { int[] result = new int[1000]; int k = 0; for (int i = 0; i < (nums.length / 2); i++) { for (int j = 0; j 阅读全文
posted @ 2020-01-17 02:16 一只桃子 阅读(182) 评论(0) 推荐(0)