上一页 1 ··· 56 57 58 59 60 61 62 63 64 ··· 79 下一页
摘要: package LeetCode_725 /** * 725. Split Linked List in Parts * https://leetcode.com/problems/split-linked-list-in-parts/description/ * * Given a (singly 阅读全文
posted @ 2020-05-19 22:54 johnny_zhao 阅读(145) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_23 import java.util.* /** * 23. Merge k Sorted Lists * https://leetcode.com/problems/merge-k-sorted-lists/description/ * * Merge k so 阅读全文
posted @ 2020-05-19 21:28 johnny_zhao 阅读(86) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_953 /** * 953. Verifying an Alien Dictionary * https://leetcode.com/problems/verifying-an-alien-dictionary/description/ * * In an ali 阅读全文
posted @ 2020-05-18 11:18 johnny_zhao 阅读(127) 评论(0) 推荐(0) 编辑
摘要: /** * Good morning! Here's your coding interview problem for today. This problem was asked by Amazon. Run-length encoding is a fast and simple method 阅读全文
posted @ 2020-05-16 11:57 johnny_zhao 阅读(116) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_396 /** * 396. Rotate Function * https://leetcode.com/problems/rotate-function/description/ * * Given an array of integers A and let 阅读全文
posted @ 2020-05-15 15:34 johnny_zhao 阅读(100) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_1232 /** * 1232. Check If It Is a Straight Line * https://leetcode.com/problems/check-if-it-is-a-straight-line/description/ * * You a 阅读全文
posted @ 2020-05-15 13:04 johnny_zhao 阅读(125) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_81 /** * 81. Search in Rotated Sorted Array II * https://leetcode.com/problems/search-in-rotated-sorted-array-ii/description/ * * Sup 阅读全文
posted @ 2020-05-13 20:31 johnny_zhao 阅读(94) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_33 /** * 33. Search in Rotated Sorted Array * https://leetcode.com/problems/search-in-rotated-sorted-array/description/ * * Suppose a 阅读全文
posted @ 2020-05-13 16:12 johnny_zhao 阅读(127) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_64 /** * 64. Minimum Path Sum * https://leetcode.com/problems/minimum-path-sum/description/ * * Given a m x n grid filled with non-ne 阅读全文
posted @ 2020-05-13 00:17 johnny_zhao 阅读(105) 评论(0) 推荐(0) 编辑
摘要: package LeetCode_113 /** * 113. Path Sum II * https://leetcode.com/problems/path-sum-ii/description/ * Given a binary tree and a sum, find all root-to 阅读全文
posted @ 2020-05-12 00:18 johnny_zhao 阅读(188) 评论(0) 推荐(0) 编辑
上一页 1 ··· 56 57 58 59 60 61 62 63 64 ··· 79 下一页