题目描述：
Given an array of integers and an integer k, return true if and only if there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j ...
类别归档：LeetCode
LeetCode OJ is a platform for preparing technical coding interviews.
[LeetCode]Contains Duplicate II
[LeetCode]Contains Duplicate
作者是
发布于
在
LeetCode.
题目描述：
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
题目大意：
给定一个整数数组 ...
[LeetCode]Combination Sum III
作者是
发布于
在
LeetCode.
题目描述：
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
Ensure that numbers within ...
[LeetCode]Kth Largest Element in an Array
作者是
发布于
在
LeetCode.
题目描述：
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
For example,
Given [3,2,1,5,6,4] and k = 2, return ...
[LeetCode]Shortest Palindrome
作者是
发布于
在
LeetCode.
题目描述：
Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.
For example:
Given "aacecaaa", return "aaacecaaa" ...