Class Solution
-
- All Implemented Interfaces:
public final class Solution2108 - Find First Palindromic String in the Array.
Easy
Given an array of strings
words, return the first palindromic string in the array. If there is no such string, return an empty string"".A string is palindromic if it reads the same forward and backward.
Example 1:
Input: words = "abc","car","ada","racecar","cool"
Output: "ada"
Explanation: The first string that is palindromic is "ada". Note that "racecar" is also palindromic, but it is not the first.
Example 2:
Input: words = "notapalindrome","racecar"
Output: "racecar"
Explanation: The first and only string that is palindromic is "racecar".
Example 3:
Input: words = "def","ghi"
Output: ""
Explanation: There are no palindromic strings, so the empty string is returned.
Constraints:
1 <= words.length <= 1001 <= words[i].length <= 100words[i]consists only of lowercase English letters.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description public classSolution.Companion
-
Field Summary
Fields Modifier and Type Field Description public final static Solution.CompanionCompanion
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final StringfirstPalindrome(Array<String> words)-
-
Method Detail
-
firstPalindrome
final String firstPalindrome(Array<String> words)
-
-
-
-