07 2019 档案

摘要:/** * This problem was asked by Microsoft. Given an array of numbers and a number k, determine if there are three entries in the array which add up to the specified number k. For example, given [20... 阅读全文
posted @ 2019-07-28 12:38 johnny_zhao 阅读(219) 评论(0) 推荐(0) 编辑
摘要:/** * 239. Sliding Window Maximum * https://leetcode.com/problems/sliding-window-maximum/description/ * * Given an array nums, there is a sliding window of size k which is moving from the very le... 阅读全文
posted @ 2019-07-20 16:18 johnny_zhao 阅读(119) 评论(0) 推荐(0) 编辑
摘要:package LeetCode_285 import java.util.* /** * 285. Inorder Successor in BST * (Prime) * Given a binary search tree and a node in it, find the in-order 阅读全文
posted @ 2019-07-02 01:55 johnny_zhao 阅读(157) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示