palindrome

[leedcode 125] Valid Palindrome

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring
·2015-07-24 20:00

leetcode第9题，判断数字是否是回文数字的两种方法

classSolution{ public: boolisPalindrome1(intx){ if(xvec; while(x) { vec.push_back(x%10); x=x/10; } vectorrvec
kesonyk·2015-07-23 23:00

LeetCode 9 Palindrome Number

PalindromeNumberDeterminewhetheranintegerisapalindrome.Dothiswithoutextraspace.有了回文字符串的基础这道题其实不难，在不借助字符串的基础上
gx262091291·2015-07-23 21:00

#leetcode#Valid Palindrome

Givenastring,determineifitisapalindrome,consideringonlyalphanumericcharactersandignoringcases.Forexample
ChiBaoNeLiuLiuNi·2015-07-22 16:00

回文串（杭州电2029）

/*Palindromes _easy version Problem Description “回文串”它是一个正读和反读同一字符串。例“level”要么“noon”等是回文序列。
·2015-07-22 11:00

LeetCode 之 Valid Palindrome（字符串）

【问题描述】Givenastring,determineifitisapalindrome,consideringonlyalphanumericcharactersandignoringcases.Forexample
u013630349·2015-07-22 09:00

LeetCode#125 Valid Palindrome

Problem Definition: Given a string, determine if it is a palindrome, considering only alphanumeric characters
·2015-07-21 11:00

[leetcode] Palindrome Number（不使用额外空间）

具体见代码：classSolution{ public: boolisPalindrome(intx){ if(x<0)//sp
NK_test·2015-07-20 20:00

Palindrome Transformations 贪心

思路：只需处理字符串的一半，即：根据右半段来修改左半段。因为同时修改对称的两个字符，所需的操作数与修改一个字符是相等的。为了使操作数最小，应该按顺序来修改。由于对称性，可将pos>mid的情况转化为pos #include #include usingnamespacestd; #defineN100005 chara[N]; intn,ans=0,last_modified; intdis(c
ww32zz·2015-07-20 16:00

【LeetCode-面试算法经典-Java实现】【009-Palindrome Number（回文数）】

【009-PalindromeNumber（回文数）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题Determinewhetheranintegerisapalindrome.Dothiswithoutextraspace
derrantcm·2015-07-19 06:35

【LeetCode-面试算法经典-Java实现】【009-Palindrome Number（回文数）】

【009-PalindromeNumber（回文数）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题Determinewhetheranintegerisapalindrome.Dothiswithoutextraspace
derrantcm·2015-07-19 06:35

【LeetCode-面试算法经典-Java实现】【009-Palindrome Number（回文数）】

【009-PalindromeNumber（回文数）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题Determinewhetheranintegerisapalindrome.Dothiswithoutextraspace
DERRANTCM·2015-07-19 06:00

[LeetCode]234.Palindrome Linked List

题目Givenasinglylinkedlist,determineifitisapalindrome.Followup:CouldyoudoitinO(n)timeandO(1)space?
SunnyYoona·2015-07-18 16:00

回文回文！

英语中单词Palindromes指顺读倒读都一样的词语，比如radar，reviver，repaper，deified，rotator。
sundujing·2015-07-18 10:00

UVALive 2889

Apalindromeisaword,number,orphrasethatreadsthesameforwardsasbackwards.Forexample,thename“anna”isapalindrome.Numberscanalsobepalindromes
KJBU2·2015-07-18 10:00

leetcode：Palindrome Linked List

Given a singly linked list, determine if it is a palindrome.
·2015-07-17 17:00

hdu1513 Palindrome

ProblemDescriptionApalindromeisasymmetricalstring,thatis,astringreadidenticallyfromlefttorightaswellasfromrighttoleft.Youaretowriteaprogramwhich
Kirito_Acmer·2015-07-17 12:00

LeetCode 234: Palindrome Linked List （回文链表）

Givenasinglylinkedlist,determineifitisapalindrome.CouldyoudoitinO(n)timeandO(1)space?
sunao2002002·2015-07-16 22:00

Codeforces 577E Ann and Half-Palindrome 字典树

题目链接题意：若一个字符串是半回文串，则满足第一位和最后一位相等，第三位和倒数第三位相等，如此类推。给定一个字符串s，输出s的所有子串中的半回文串字典序第k大的字符串。good[i][j]表示s(i,j)是半回文串。把这些回文串插到字典树里在字典树上找第k个叶子节点。插入时：插入以i点开头的所有半回文串。#include #include #include #include #include #i
qq574857122·2015-07-16 22:00

LeetCode#234 Palindrome Linked List

Problem Definition: 　　Given a singly linked list, determine if it is a palindrome. 　　
·2015-07-15 19:00

LeetCode OJ 之 Palindrome Linked List（回文链表判断）

题目：Givenasinglylinkedlist,determineifitisapalindrome.Followup:CouldyoudoitinO(n)timeandO(1)space?
u012243115·2015-07-14 14:00

Leetcode 234 Palindrome Linked List 复杂度为时间O(n) 和空间（1）解法

1.问题描述给定一个单链表，判断其内容是不是回文类型。例如1–>2–>3–>2–>1。时间和空间复杂都尽量低。2.方法与思路1）比较朴素的算法。由于给定的数据结构是单链表，要访问链表的尾部元素，必须从头开始遍历。为了方便判断，我们可以申请一个辅助栈结构来存储链表的内容，第一次遍历将链表节点值依次入栈，第二次遍历比较判断是否为回文。/***Definitionforsingly-linkedlist
Jeanphorn·2015-07-14 12:00

leetcode 234: Palindrome Linked List

Givenasinglylinkedlist,determineifitisapalindrome.Followup:CouldyoudoitinO(n)timeandO(1)space?
xudli·2015-07-14 04:00

Shortest Palindrome

GivenastringS,youareallowedtoconvertittoapalindromebyaddingcharactersinfrontofit.Findandreturntheshortestpalindromeyoucanfindbyperformingthistransformation.Forexample
brucehb·2015-07-14 00:00

【动态规划】[UVa11584]Partitioning by Palindromes

我们令f(i,j)表示在字符串中从i-j的回文串的分割后的最小次数，那么可以很容易的发现f(i,j)=min{f(i,k)}+1条件是从k+1到i的这几个字符串是回文串，那么才可以进行分割,这道题目唯一要注意的地方就是注意在预处理回文串的判断的时候要注意奇数串和偶数串#include #include #include #include usingnamespacestd; constintMAX
JeremyGJY·2015-07-13 11:00

【leetcode】 9. palindrome number

@requires_authorization @authorjohnsondu @create_time2015.7.139:48 @url[palindrome-number](https://leetcode.com
zone_programming·2015-07-13 09:00

Leetcode - Palindrome Linked List

Given a singly linked list, determine if it is a palindrome.
likesky3·2015-07-12 08:00

Ann and Half-Palindrome 字典树

E.AnnandHalf-Palindrometimelimitpertest1.5secondsmemorylimitpertest512megabytesinputstandardinputoutputstandardoutputTomorrowAnntakesthehardestexamofprogrammingwheresheshouldgetanexcellentmark.Onthela
u010422038·2015-07-12 00:00

Palindrome Linked List (leetcode 234)

Givenasinglylinkedlist,determineifitisapalindrome.Followup:CouldyoudoitinO(n)timeandO(1)space?
wuhuaiyu·2015-07-11 20:00

11584 - Partitioning by Palindromes（DP）

和上一题“照明系统设计”类似，我们可以逐步递推出最优解，d[i]表示1~i个字符的最优解，那么d[i]=min(d[i],d[j]+1)|当s[j+1~i]为回文串时。大家可以自行打印d这个数组，来体会一下状态的转移情况。代码如下：#include usingnamespacestd; constintmaxn=1000+10; constintINF=2000000000; intT,n,cnt
weizhuwyzc000·2015-07-11 16:00

Palindrome Linked List

Givenasinglylinkedlist,determineifitisapalindrome.Followup:CouldyoudoitinO(n)timeandO(1)space?
brucehb·2015-07-11 00:00

[LeetCode] Valid Palindrome

The suggested solution to this problem has given a clear idea. The tricky part of this problem is to handle all the edge cases carefully and write a clean code. The following code should be self-expl
·2015-07-10 20:00

【LeetCode】234 Palindrome Linked List

PalindromeLinkedListTotalAccepted:1116TotalSubmissions:4295MySubmissionsQuestionSolution Givenasinglylinkedlist
u013027996·2015-07-10 16:00

[LeetCode] Palindrome Linked List

The idea is not so obvious at first glance. Since you cannot move from a node back to its previous node in a singly linked list, we choose to reverse the right half of the list and then compare it wit
·2015-07-10 13:00

[LeetCode] Palindrome Linked List 回文链表

  Given a singly linked list, determine if it is a palindrome.
·2015-07-10 12:00

寻找回文数的python的实现

方法一：一行代码解决#coding=UTF-8 #寻找回文数 defis_palindrome(n): s=str(n) returns[0:len(s)//2]==s[-1:len(s)//2:-1]
u010412719·2015-07-09 21:00

Codeforces Round #311 (Div. 2) E - Ann and Half-Palindrome（字典树+dp）

E.AnnandHalf-Palindrometimelimitpertest1.5secondsmemorylimitpertest512megabytesinputstandardinputoutputstandardoutputTomorrowAnntakesthehardestexamofprogrammingwheresheshouldgetanexcellentmark.Onthela
kalilili·2015-07-08 13:00

Ann and Half-Palindrome

题目描述：给定半回文子串的定义，现给你一个串S和一个整数K，输出S所有子串中且是半回文排名第K的子串，半回文子串按照字典序升序顺序。（len(S)#defineMAX_ASCII2usingnamespacestd;constintN=5e+3+7;booldp[N][N];charstr[N];intdict[N*N][MAX_ASCII+1],cnt=1;//字典树插入voidInsert(c
Sky丶Memory·2015-07-08 13:00

Ann and Half-Palindrome

题目描述：给定半回文子串的定义，现给你一个串S和一个整数K，输出S所有子串中且是半回文排名第K的子串，半回文子串按照字典序升序顺序。（len(S)#defineMAX_ASCII2usingnamespacestd;constintN=5e+3+7;booldp[N][N];charstr[N];intdict[N*N][MAX_ASCII+1],cnt=1;//字典树插入voidInsert(c
Sky丶Memory·2015-07-08 13:00

LeetCode131:Palindrome Partitioning

Givenastrings,partitionssuchthateverysubstringofthepartitionisapalindrome.Returnallpossiblepalindromepartitioningofs.Forexample
u012501459·2015-07-07 17:00

Reverse Integer - Palindrome Number - 简单模拟

第一个题目是将整数进行反转，这个题实现反转并不难，主要关键点在于如何进行溢出判断。溢出判断再上一篇字符串转整数中已有介绍，本题采用其中的第三种方法，将数字转为字符串，使用字符串比较大小的方法进行比较。 代码如下： 1 class Solution { 2 public: 3 int reverse(int x) { 4 int stand[10]={2,
·2015-07-07 13:00

Ann and Half-Palindrome (DP+字典树)

题目地址：传送门先用dp求出所有的符合要求的半回文串，标记出来。然后构造字典树。然后再dfs一遍求出所有节点的子树和，最后搜一遍就能找出第k个来了。代码如下：#include #include #include #include #include #include #include #include #include #include usingnamespacestd; #defineLL__i
u013013910·2015-07-02 21:00

Shortest Palindrome ---再见回文和KMP

题目大意  给定串S，要求在其前面(infrontof)增加最少的串构成回文并输出回文串。解题思路   席八，这个题目无愧其hard的标签，我想破脑袋也才想了个宽搜的暴力，而且还忽略了要加载S串前面的基本要求，审题不仔细，还是太浮躁了。这题没做出来，仔细琢磨了网上的解法，现总结如下：  先明确几个理论，以后想回文相关的题目从这几点入手:                   1、回文串=revers
zhang360896270·2015-07-01 13:00

leetcode 9 Palindrome Number 回文数

Determinewhetheranintegerisapalindrome.Dothiswithoutextraspace.clicktoshowspoilers.Somehints:Couldnegativeintegersbepalindromes
wangyaninglm·2015-06-28 20:00

[LintCode] 有效回文串

2 public: 3 /** 4 * @param s A string 5 * @return Whether the string is a valid palindrome
·2015-06-28 15:00

Codeforces #265 Div 1 简要题解

A.NotoPalindromes!
qpswwww·2015-06-24 16:00

Longest Palindrome Subsequence

Given a sequence, find the length of the longest palindromic subsequence in it. For example, if the given sequence is “BBABCBCAB”, then the output should be 7 as “BABCBAB” is the longest palindromic s
yuanhsh·2015-06-23 14:00

Longest Palindrome Subsequence

Givenasequence,findthelengthofthelongestpalindromicsubsequenceinit.Forexample,ifthegivensequenceis“BBABCBCAB”,thentheoutputshouldbe7as“BABCBAB”isthelongestpalindromicsubseuqnceinit. “BBBBB”and“BBCBB”a
yuanhsh·2015-06-23 14:00

Palindrome Number

public class Solution {      public boolean isPalindrome(int x) {         //negative numbers are not 
小白家的许仙·2015-06-22 21:00

UVa401 Palindromes

#include <stdio.h>#include <string.h>char mirror(char c){    static const char m[] = "A   3  HIL JM O   2TUVWXY51SE Z  8 "; &nbs
·2015-06-20 14:00
上一页 77 78 79 80 81 82 83 84 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他