首页
学习
活动
专区
圈层
工具
发布
    • 综合排序
    • 最热优先
    • 最新优先
    时间不限
  • 来自专栏皮皮星球

    palindrome - 131. Palindrome Partitioning

    Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

    44510发布于 2020-09-23
  • 来自专栏皮皮星球

    Palindrome - 125. Valid Palindrome

    Valid Palindrome Given a string, determine if it is a palindrome, considering only alphanumeric characters Note: For the purpose of this problem, we define empty string as valid palindrome.

    42920发布于 2020-09-23
  • 来自专栏皮皮星球

    palindrome - 132. Palindrome Partitioning II

    Palindrome Partitioning II Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. Example: Input: "aab" Output: 1 Explanation: The palindrome partitioning ["aa","b"] could be produced

    41220发布于 2020-09-23
  • 来自专栏皮皮星球

    Palindrome - 9. Palindrome Number

    Palindrome Number Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Therefore it is not a palindrome. Therefore it is not a palindrome.

    40420发布于 2020-09-23
  • 来自专栏奔跑的蛙牛技术博客

    palindrome-number

    Runtime: 8 ms, faster than 46.98% of Rust online submissions for Palindrome Number. Memory Usage: 2.3 MB, less than 100.00% of Rust online submissions for Palindrome Number. pub fn is_palindrome(x: i32) -> bool { let mut x = x; if x < 0 || (x % 10 == 0 && x !

    44710发布于 2019-12-13
  • 来自专栏SnailTyan

    Palindrome Number

    1. Description 2. Solution class Solution { public: bool isPalindrome(int x) { if(x < 0)

    55130发布于 2019-05-25
  • 来自专栏全栈程序员必看

    LeetCode: Valid Palindrome

    大家好,又见面了,我是全栈君 【题目】 Given a string, determine if it is a palindrome, considering only alphanumeric characters For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a palindrome. For the purpose of this problem, we define empty string as valid palindrome.

    27710编辑于 2022-07-14
  • 来自专栏给永远比拿愉快

    Leetcode: Palindrome Number

    题目: Determine whether an integer is a palindrome. Do this without extra space.

    47520发布于 2019-01-22
  • 来自专栏算法修养

    LeetCode 131 Palindrome Partitioning

    LeetCode 131 Palindrome Partitioning 划分字符串,得到每一个子串都是回文串,输出所有的方案。 思路是,先将所有的回文子串都找出来,记录下左右端点。

    44710发布于 2018-12-07
  • 来自专栏全栈程序员必看

    125 Valid Palindrome

    125 Valid Palindrome 链接:https://leetcode.com/problems/valid-palindrome/ 问题描写叙述: Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is not a palindrome. Note: Have you consider that the string might be empty? For the purpose of this problem, we define empty string as valid palindrome.

    33510编辑于 2022-07-10
  • 来自专栏算法修养

    LeetCode 125 Valid Palindrome

    题目:https://leetcode.com/problems/valid-palindrome/description/ Given a string, determine if it is a palindrome Note: For the purpose of this problem, we define empty string as valid palindrome.

    40930发布于 2018-07-24
  • 来自专栏计算机视觉与深度学习基础

    Leetcode 125 Valid Palindrome

    Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a palindrome. For the purpose of this problem, we define empty string as valid palindrome. 判断是否为回文串。

    64890发布于 2018-01-12
  • 来自专栏米扑专栏

    【leetcode】Palindrome Partitioning

    Question: Given a string s, partition s such that every substring of the partition is a palindrome Return all possible palindrome partitioning of s. push_back(s.substr(index[i][j],index[i][j+1]-index[i][j])); } } return res; } }; 参考推荐: leetcode:Palindrome Partitioning Palindrome Partitioning

    46930发布于 2019-02-19
  • 来自专栏WD学习记录

    Leetcode Palindrome Number

    题目:Palindrome Number Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Therefore it is not a palindrome. Therefore it is not a palindrome. =arr[-i-1]: return False return True 参考最快的解决方法:Palindrome Number class Solution

    52360发布于 2018-09-04
  • 来自专栏全栈程序员必看

    LeetCode——Valid Palindrome

    Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a palindrome. For the purpose of this problem, we define empty string as valid palindrome. 原题链接:https://oj.leetcode.com/problems/valid-palindrome/ 题目:给定一个字符串,检測其是否是回文串,仅仅考虑字母数字字符。

    32330编辑于 2022-07-10
  • 来自专栏米扑专栏

    【leetcode】Palindrome Number

    Question: Determine whether an integer is a palindrome. Do this without extra space. main() function if(x < 0) return false; return check(x, x); } }; 参考推荐: Palindrome

    49230发布于 2019-02-19
  • 来自专栏给永远比拿愉快

    Leetcode: Valid Palindrome

    题目: Given a string, determine if it is a palindrome, considering only alphanumeric characters and For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is not a palindrome. Note: Have you consider that the string might be empty? For the purpose of this problem, we define empty string as valid palindrome.

    46220发布于 2019-01-22
  • 来自专栏米扑专栏

    【leetcode】Valid Palindrome

    Question: Given a string, determine if it is a palindrome, considering only alphanumeric characters For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a palindrome. For the purpose of this problem, we define empty string as valid palindrome.

    45230发布于 2019-02-19
  • 来自专栏Reck Zhang

    LeetCode 0336 - Palindrome Pairs

    Palindrome Pairs Desicription Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrome

    39730发布于 2021-08-11
  • 来自专栏Reck Zhang

    LeetCode 0131 - Palindrome Partitioning

    Palindrome Partitioning Desicription Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

    35210发布于 2021-08-11
领券