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 <= 100
- 1 <= words[i].length <= 100
- words[i] consists only of lowercase English letters.
class Solution:
def firstPalindrome(self, words: List[str]) -> str:
for i in words:
if i==i[::-1]:
return i
return ""'알고리즘 문제 > Leetcode' 카테고리의 다른 글
| 1768. Merge Strings Alternately (0) | 2022.12.22 |
|---|---|
| 344. Reverse String (0) | 2022.12.22 |
| 832. Flipping an Image (0) | 2022.12.20 |
| 557. Reverse Words in a String III (0) | 2022.12.20 |
| 1757. Recyclable and Low Fat Products (0) | 2022.12.20 |