James Pan

原题网址：https://leetcode.com/problems/palindrome-partitioning/ Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitionin

原题网址：https://leetcode.com/problems/longest-palindromic-substring/ Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there e

原题网址：https://leetcode.com/problems/palindrome-number/ Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Some hints: Could negative integers

原题网址：https://leetcode.com/problems/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 palindrom

原题网址：https://leetcode.com/problems/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.

原题网址：https://leetcode.com/problems/palindrome-partitioning-ii/ Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a pa