Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

回文串构成的第二种情况定义有误 #665

Copy link
Copy link
@heibai23

Description

@heibai23
Issue body actions
  • 位置:算法-几道常见的子符串算法题-4.1
  • 内容:字符出现次数为双数的组合+一个只出现一次的字符
  • 有误点:只出现一次有误,因为也可以是出现三次、五次
    • 例子:aabbcccd,此时最长应为 abcccba,c出现为三次
  • 个人见解:应该为字符出现次数为偶数的组合+单个字符中出现次数最多且为奇数次的字符
Reactions are currently unavailable

Metadata

Metadata

Assignees

No one assigned

    Labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions

      Morty Proxy This is a proxified and sanitized view of the page, visit original site.