上一页 1 ··· 32 33 34 35 36 37 38 39 40 ··· 79 下一页
摘要: package LeetCode_388 import java.util.* /** * 388. Longest Absolute File Path * https://leetcode.com/problems/longest-absolute-file-path/description/ 阅读全文
posted @ 2020-10-04 11:23 johnny_zhao 阅读(207) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_360 /** * 360. Sort Transformed Array * (Prime) * Given a sorted array of integers nums and integer values a, b and c. * Apply a quad 阅读全文
posted @ 2020-10-03 16:23 johnny_zhao 阅读(112) 评论(0) 推荐(0) 编辑
摘要: /** * This problem was asked by Google. You are given an array of arrays of integers, where each array corresponds to a row in a triangle of numbers. 阅读全文
posted @ 2020-10-03 15:19 johnny_zhao 阅读(74) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_317 import java.util.* /** * 317. Shortest Distance from All Buildings * (Prime) * You want to build a house on an empty land which r 阅读全文
posted @ 2020-10-02 15:16 johnny_zhao 阅读(128) 评论(0) 推荐(0) 编辑
摘要: /** * This problem was asked by Facebook. Given a function f, and N return a debounced f of N milliseconds. That is, as long as the debounced f contin 阅读全文
posted @ 2020-10-02 10:22 johnny_zhao 阅读(118) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_41 /** * 41. First Missing Positive * https://leetcode.com/problems/first-missing-positive/description/ * Given an unsorted integer a 阅读全文
posted @ 2020-10-01 16:58 johnny_zhao 阅读(81) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_279 import java.util.* /** * 279. Perfect Squares * https://leetcode.com/problems/perfect-squares/description/ * * Given a positive i 阅读全文
posted @ 2020-10-01 11:14 johnny_zhao 阅读(137) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_684 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 684. Redundant Connection * https: 阅读全文
posted @ 2020-09-30 13:52 johnny_zhao 阅读(112) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_272 import java.util.* import kotlin.collections.ArrayList /** * 272. Closest Binary Search Tree Value II * (Prime) * Given a non-emp 阅读全文
posted @ 2020-09-28 21:46 johnny_zhao 阅读(104) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_270 import java.util.* /** * 270. Closest Binary Search Tree Value * (Prime) * Given a non-empty binary search tree and a target valu 阅读全文
posted @ 2020-09-28 21:30 johnny_zhao 阅读(92) 评论(0) 推荐(0) 编辑
上一页 1 ··· 32 33 34 35 36 37 38 39 40 ··· 79 下一页