Problem : Given an integer, write a function to determine if it is a power of two. Example 1: Example 2: Example 3: `` Input: 218 Output: false c bool ...
分类：
其他好文 时间：
2020-04-06 00:03:04
阅读次数：
83
Problem : A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element a ...
分类：
其他好文 时间：
2020-04-05 23:55:14
阅读次数：
129
Problem : Remove all elements from a linked list of integers that have value val. Example: 思路 ： Solution (C++) : 性能 ： Runtime: 44 ms Memory Usage: 10. ...
分类：
其他好文 时间：
2020-04-05 13:36:39
阅读次数：
67
Problem : Given a list of non negative integers, arrange them such that they form the largest number. Example 1: Example 2: Note: The result may be ve ...
分类：
其他好文 时间：
2020-04-04 22:44:47
阅读次数：
75
Description Given a string which contains only lowercase letters, remove duplicate letters so that every letter appears once and only once. You must m ...
分类：
编程语言 时间：
2020-04-04 20:54:05
阅读次数：
76
The sequence of mm integers is called the permutation if it contains all integers from 11 to mm exactly once. The number mm is called the length of th ...
分类：
其他好文 时间：
2020-04-04 14:19:57
阅读次数：
98
题目如下： Given an array of integers arr, a lucky integer is an integer which has a frequency in the array equal to its value. Return a lucky integer in t ...
分类：
其他好文 时间：
2020-04-04 14:18:51
阅读次数：
71
K个不同整数的子数组。题意是给定一个正整数数组 A，如果 A 的某个子数组中不同整数的个数恰好为 K，则称 A 的这个连续、不一定独立的子数组为好子数组。返回A中好子数组的数量。例子， Example 1: Input: A = [1,2,1,2,3], K = 2 Output: 7 Explan ...
分类：
其他好文 时间：
2020-04-04 09:53:38
阅读次数：
53
leetcode 53. Maximum Subarray 链接 "leetcode" 描述 Given an integer array nums, find the contiguous subarray (containing at least one number) which has th ...
分类：
其他好文 时间：
2020-04-03 16:25:10
阅读次数：
60
One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions ...
分类：
其他好文 时间：
2020-04-02 22:39:14
阅读次数：
84
