当前位置: 首页>>代码示例>>Python>>正文


Python Solution.longestPalindrome方法代码示例

本文整理汇总了Python中solution.Solution.longestPalindrome方法的典型用法代码示例。如果您正苦于以下问题:Python Solution.longestPalindrome方法的具体用法?Python Solution.longestPalindrome怎么用?Python Solution.longestPalindrome使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在solution.Solution的用法示例。


在下文中一共展示了Solution.longestPalindrome方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: test

# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import longestPalindrome [as 别名]
def test():
    sol = Solution()
    print sol.longestPalindrome('abccbabaaa')
    assert sol.longestPalindrome('abccbabaaa') == 'abccba'
    assert sol.longestPalindrome('aaaaaaaa') == 'aaaaaaaa'
    assert sol.longestPalindrome('aababcba') == 'abcba'
    assert sol.longestPalindrome('cacaaaabbaa') == 'aabbaa'
开发者ID:misaka-10032,项目名称:leetcode,代码行数:9,代码来源:test.py

示例2: TestCase

# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import longestPalindrome [as 别名]
class TestCase(unittest.TestCase):
    def setUp(self):
        self.solution = Solution()

    def test_solution(self):
        self.assertEqual(self.solution.longestPalindrome('abcdcbabc'), 'abcdcba')
        self.assertEqual(self.solution.longestPalindrome('ddabccbaa'), 'abccba')
        self.assertEqual(self.solution.longestPalindrome('abcbabcba'), 'abcbabcba')
        self.assertEqual(self.solution.longestPalindrome('z' * 1000), 'z' * 1000)
开发者ID:romain-li,项目名称:leetcode,代码行数:11,代码来源:test.py

示例3: Solution

# 需要导入模块: from solution import Solution [as 别名]
# 或者: from solution.Solution import longestPalindrome [as 别名]
#!/usr/bin/env python
# -*- coding: utf-8 -*-

from solution import Solution

input = "kyyrjtdplseovzwjkykrjwhxquwxsfsorjiumvxjhjmgeueafubtonhlerrgsgohfosqssmizcuqryqomsipovhhodpfyudtusjhonlqabhxfahfcjqxyckycstcqwxvicwkjeuboerkmjshfgiglceycmycadpnvoeaurqatesivajoqdilynbcihnidbizwkuaoegmytopzdmvvoewvhebqzskseeubnretjgnmyjwwgcooytfojeuzcuyhsznbcaiqpwcyusyyywqmmvqzvvceylnuwcbxybhqpvjumzomnabrjgcfaabqmiotlfojnyuolostmtacbwmwlqdfkbfikusuqtupdwdrjwqmuudbcvtpieiwteqbeyfyqejglmxofdjksqmzeugwvuniaxdrunyunnqpbnfbgqemvamaxuhjbyzqmhalrprhnindrkbopwbwsjeqrmyqipnqvjqzpjalqyfvaavyhytetllzupxjwozdfpmjhjlrnitnjgapzrakcqahaqetwllaaiadalmxgvpawqpgecojxfvcgxsbrldktufdrogkogbltcezflyctklpqrjymqzyzmtlssnavzcquytcskcnjzzrytsvawkavzboncxlhqfiofuohehaygxidxsofhmhzygklliovnwqbwwiiyarxtoihvjkdrzqsnmhdtdlpckuayhtfyirnhkrhbrwkdymjrjklonyggqnxhfvtkqxoicakzsxmgczpwhpkzcntkcwhkdkxvfnjbvjjoumczjyvdgkfukfuldolqnauvoyhoheoqvpwoisniv"
sol = Solution()
result = sol.longestPalindrome(input)
print(result)

开发者ID:zhlinh,项目名称:leetcode,代码行数:11,代码来源:test.py


注:本文中的solution.Solution.longestPalindrome方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。