[LeetCode] 658. Find K Closest Elements 尋找K個最近元素
Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. ...
原文：[LeetCode] Find the Closest Palindrome 尋找最近的回文串
Given an integer n, find the closest integer not including itself , which is a palindrome. The closest is defined as absolute difference minimized between two integers. Example : Note: The inputnis a ...
2017-05-28 11:30 1 6218 推薦指數：
相關推薦
[LeetCode] Longest Palindrome 最長回文串
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. ...
[LeetCode] Palindrome Partitioning 拆分回文串
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. ...
[LeetCode] Palindrome Pairs 回文對
Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words ...
[LeetCode] Largest Palindrome Product 最大回文串乘積
Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest ...
[LeetCode] Valid Palindrome 驗證回文字符串
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan ...
[LeetCode] Palindrome Partitioning II 拆分回文串之二
partitioning of s. Example: 這道題是讓找到把原字符串拆分成回文串的最小切割 ...
[LeetCode] 214. Shortest Palindrome 最短回文串
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 ...