find-first-palindromic-string-in-the-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of strings <code>words</code>, return the first palindromic string in the array. If there is no such string, return an empty string <code>&quot;&quot;</code>.

A string is palindromic if it reads the same forward and backward.

&nbsp;
Example 1:

<pre>
Input: words = [&quot;abc&quot;,&quot;car&quot;,&quot;ada&quot;,&quot;racecar&quot;,&quot;cool&quot;]
Output: &quot;ada&quot;
Explanation: The first string that is palindromic is &quot;ada&quot;.
Note that &quot;racecar&quot; is also palindromic, but it is not the first.
</pre>

Example 2:

<pre>
Input: words = [&quot;notapalindrome&quot;,&quot;racecar&quot;]
Output: &quot;racecar&quot;
Explanation: The first and only string that is palindromic is &quot;racecar&quot;.
</pre>

Example 3:

<pre>
Input: words = [&quot;def&quot;,&quot;ghi&quot;]
Output: &quot;&quot;
Explanation: There are no palindromic strings, so the empty string is returned.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> consists only of lowercase English letters.</li>
</ul>

firstPalindrome

Find First Palindromic String in the Array

Valid Palindrome

valid-palindrome

验证回文串

Array

Two Pointers

String

给你一个字符串数组 <code>words</code> ，找出并返回数组中的 第一个回文字符串 。如果不存在满足要求的字符串，返回一个 空字符串 <code>""</code> 。

回文字符串 的定义为：如果一个字符串正着读和反着读一样，那么该字符串就是一个 回文字符串 。

&nbsp;

示例 1：

<pre>输入：words = ["abc","car","ada","racecar","cool"]
输出："ada"
解释：第一个回文字符串是 "ada" 。
注意，"racecar" 也是回文字符串，但它不是第一个。
</pre>

示例 2：

<pre>输入：words = ["notapalindrome","racecar"]
输出："racecar"
解释：第一个也是唯一一个回文字符串是 "racecar" 。
</pre>

示例 3：

<pre>输入：words = ["def","ghi"]
输出：""
解释：不存在回文字符串，所以返回一个空字符串。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> 仅由小写英文字母组成</li>
</ul>