把相同的词汇或句子,在下文中调换位置或颠倒过来,产生首尾回环的情趣,叫做回文,也叫回环。
回文数 palindromic number ; Palindrome Number
回文素数 palindromic prime
严格非回文数 strictly non-palindromic number
回文序列 palindromic sequence ; [生化] palindrome
回文结构 [生化] palindrome ; palindromic structure ; palindromic sequence ; Palindromic
短回文重复序列 CRISPR ; clustered regularly interspaced short palindromic repeats
最长回文子串 Longest Palindromic Substring
他打出租车将她送回文森特广场,在门阶上客气地道了晚安。
He took her back to Vincent Square in a taxi, saying goodnight formally on the doorstep.
给定关键字后,返回文档unid。
And now let's do one, a, two. Whoops.
它还告诉我这个数组是回文的?
Notice by the way, there's that nice speck true going on saying put a string here.
在这里说放一个字符串在这儿有点小问题,如果是回文的话那么它将会返回真值。
There's the base case. If it's longer than one, what do I want to do? Well I'd like to check the two end points to see are they the same character? And if they are, then oh, I just need to know is everything else in the middle a palindrome?
如果只有一个元素也是回文,这是基本事件,如果比一个长的话那么我应该怎么做?,我将会查看两头是否相同?,如果是的,我只要知道中间剩下的部分是不是回文即可?
应用推荐