博客园 - Pickleuuid:24b78886-0ed1-41c2-8670-e3f31dcf42c4;id=1560602022-03-14T14:45:01ZPicklehttps://www.cnblogs.com/wxisme/feed.cnblogs.comhttps://www.cnblogs.com/wxisme/p/10626283.htmlLeetCode - 703. Kth Largest Element in a Stream - PickleDesign a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.2019-03-30T03:30:00Z2019-03-30T03:30:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. <a href="https://www.cnblogs.com/wxisme/p/10626283.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/10083958.htmlLeetCode - 905. Sort Array By Parity - PickleGiven an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A. You may re2018-12-07T09:11:00Z2018-12-07T09:11:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A. You may re <a href="https://www.cnblogs.com/wxisme/p/10083958.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/10053955.htmlLeetCode - 231. Power of Two - PickleGiven an integer, write a function to determine if it is a power of two. Example 1: Example 2: Input: 5 Output: false判断一个数是否为2的次幂,偶然发现3年前做这道题就是很简单的循环对2018-12-02T08:27:00Z2018-12-02T08:27:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given an integer, write a function to determine if it is a power of two. Example 1: Example 2: Input: 5 Output: false判断一个数是否为2的次幂,偶然发现3年前做这道题就是很简单的循环对 <a href="https://www.cnblogs.com/wxisme/p/10053955.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9971913.htmlLeetCode - 929. Unique Email Addresses - PickleEvery email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com, alice is the local name, and leet2018-11-16T13:59:00Z2018-11-16T13:59:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Every email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com, alice is the local name, and leet <a href="https://www.cnblogs.com/wxisme/p/9971913.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9971903.htmlLeetCode - 804. Unique Morse Code Words - PickleInternational Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" map2018-11-16T13:57:00Z2018-11-16T13:57:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" map <a href="https://www.cnblogs.com/wxisme/p/9971903.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9878494.htmlJVM监控和调优常用命令工具总结 - PickleJVM监控和调优 在Java应用和服务出现莫名的卡顿、CPU飙升等问题时总是要分析一下对应进程的JVM状态以定位问题和解决问题并作出相应的优化,在这过程中Java自带的一些状态监控命令和图形化工具就非常方便了。本文总结了最常用的命令行工具及其常用参数解释,图形化监控工具的用法,仅供参考。 jps J2018-11-05T02:08:00Z2018-11-05T02:08:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】JVM监控和调优 在Java应用和服务出现莫名的卡顿、CPU飙升等问题时总是要分析一下对应进程的JVM状态以定位问题和解决问题并作出相应的优化,在这过程中Java自带的一些状态监控命令和图形化工具就非常方便了。本文总结了最常用的命令行工具及其常用参数解释,图形化监控工具的用法,仅供参考。 jps J <a href="https://www.cnblogs.com/wxisme/p/9878494.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9885705.htmlLeetCode - 206. Reverse Linked List - PickleReverse a singly linked list. Example: Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? 反转单链表,看到我2018-10-31T12:29:00Z2018-10-31T12:29:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Reverse a singly linked list. Example: Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? 反转单链表,看到我 <a href="https://www.cnblogs.com/wxisme/p/9885705.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9885541.htmlLeetCode - 24. Swap Nodes in Pairs - PickleGiven a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no2018-10-31T12:06:00Z2018-10-31T12:06:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a linked list, swap every two adjacent nodes and return its head. Example: Note: Your algorithm should use only constant extra space. You may no <a href="https://www.cnblogs.com/wxisme/p/9885541.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9797920.htmlLeetCode - 581. Shortest Unsorted Continuous Subarray - PickleGiven an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be 2018-10-16T06:44:00Z2018-10-16T06:44:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be <a href="https://www.cnblogs.com/wxisme/p/9797920.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9792134.htmlLeetCode - 437. Path sum III - PickleYou are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t2018-10-15T09:14:00Z2018-10-15T09:14:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t <a href="https://www.cnblogs.com/wxisme/p/9792134.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9791771.htmlLeetCode - Subarray sum equals k - PickleGiven an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Note: 解法一:利用s2018-10-15T08:32:00Z2018-10-15T08:32:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Note: 解法一:利用s <a href="https://www.cnblogs.com/wxisme/p/9791771.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9766135.htmlLeetCode - 142. Linked List Cycle II - PickleGiven a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up:Can you2018-10-10T06:26:00Z2018-10-10T06:26:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up:Can you <a href="https://www.cnblogs.com/wxisme/p/9766135.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9766096.htmlLeetCode - 141. Linked List Cycle - PickleGiven a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 经典问题,判断一个单向链表是否有环,快慢指针,有相遇即有环。2018-10-10T06:21:00Z2018-10-10T06:21:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 经典问题,判断一个单向链表是否有环,快慢指针,有相遇即有环。 <a href="https://www.cnblogs.com/wxisme/p/9766096.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9719660.htmlLeetCode - 347. Top K Frequent Elements - PickleGiven a non-empty array of integers, return the k most frequent elements. Example 1: Example 2: Input: nums = [1], k = 1 Output: [1] Example 2: Note: 2018-09-28T09:03:00Z2018-09-28T09:03:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a non-empty array of integers, return the k most frequent elements. Example 1: Example 2: Input: nums = [1], k = 1 Output: [1] Example 2: Note: <a href="https://www.cnblogs.com/wxisme/p/9719660.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9641277.htmlLeetCode - 3. Longest Substring Without Repeating Characters - PickleGiven a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 2018-09-13T08:16:00Z2018-09-13T08:16:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer <a href="https://www.cnblogs.com/wxisme/p/9641277.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9561674.htmlLeetCode - 868. Binary Gap - PickleGiven a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N. If there aren't two co2018-08-30T09:49:00Z2018-08-30T09:49:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N. If there aren't two co <a href="https://www.cnblogs.com/wxisme/p/9561674.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9504195.htmlLeetCode - 768. Max Chunks To Make Sorted II - PickleThis question is the same as "Max Chunks to Make Sorted" except the integers of the given array are not necessarily distinct, the input array could be2018-08-20T02:38:00Z2018-08-20T02:38:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】This question is the same as "Max Chunks to Make Sorted" except the integers of the given array are not necessarily distinct, the input array could be <a href="https://www.cnblogs.com/wxisme/p/9504195.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9504192.htmlLeetCode - 769. Max Chunks To Make Sorted - PickleGiven an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of "chunks" (partitions), and individuall2018-08-20T02:37:00Z2018-08-20T02:37:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of "chunks" (partitions), and individuall <a href="https://www.cnblogs.com/wxisme/p/9504192.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9504180.htmlLeetCode - 767. Reorganize String - PickleGiven a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output 2018-08-20T02:35:00Z2018-08-20T02:35:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output <a href="https://www.cnblogs.com/wxisme/p/9504180.html" target="_blank">阅读全文</a>https://www.cnblogs.com/wxisme/p/9504172.htmlLeetCode - 766. Toeplitz Matrix - PickleA matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element. Now given an M x N matrix, return True if and only if the m2018-08-20T02:33:00Z2018-08-20T02:33:00ZPicklehttps://www.cnblogs.com/wxisme/【摘要】A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element. Now given an M x N matrix, return True if and only if the m <a href="https://www.cnblogs.com/wxisme/p/9504172.html" target="_blank">阅读全文</a>