Closed
Description
I am Chinese leetcoder。this is the website: https://leetcode-cn.com
Can you provide config to get Chinese problem description and Others.
for example, when i run command"leetcode show 3 -g -l cpp" i get:
[3] Longest Substring Without Repeating Characters
https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/description/
- algorithms
- Medium (18.53%)
- Source Code: 3.longest-substring-without-repeating-characters.2.cpp
- Total Accepted: 705
- Total Submissions: 3.9K
- Testcase Example: '"abcabcbb"'
Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb", the answer is "abc", which the length is 3.
Given "bbbbb", the answer is "b", with the length of 1.
Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
I wish to get
[3] Longest Substring Without Repeating Characters
https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/description/
- algorithms
- Medium (18.53%)
- Source Code: 3.longest-substring-without-repeating-characters.2.cpp
- Total Accepted: 705
- Total Submissions: 3.9K
- Testcase Example: '"abcabcbb"'
给定一个字符串，找出不含有重复字符的 最长子串 的长度。
示例：
给定 "abcabcbb" ，没有重复字符的最长子串是 "abc" ，那么长度就是3。
给定 "bbbbb" ，最长的子串就是 "b" ，长度是1。
给定 "pwwkew" ，最长子串是 "wke" ，长度是3。请注意答案必须是一个子串，"pwke" 是 子序列 而不是子串。