-
Notifications
You must be signed in to change notification settings - Fork 459
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
about leetcode-cn.com #93
Comments
worth a try to simply replace "leetcode.com" with "leetcode-cn.com" in lib/config.js |
I had replaced the urls in config.js and relogin. the problem description is also English. |
I wrote some codes to modify the graphql request.So that It can support Chinese content.But I haven’t tested it on the https://leetcode.com yet. This is my first time writing nodejs code. it might have some flaws in it , please let me know if you find one . |
Good job! @EINDEX |
@skygragon |
@ALL a lightweight plugin "leetcode.cn" is available in https://github.com/skygragon/leetcode-cli-plugins/. Basically it does nothing magical except replacing the urls used in leetcode-cli. |
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/
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/
给定一个字符串,找出不含有重复字符的 最长子串 的长度。
示例:
给定 "abcabcbb" ,没有重复字符的最长子串是 "abc" ,那么长度就是3。
给定 "bbbbb" ,最长的子串就是 "b" ,长度是1。
给定 "pwwkew" ,最长子串是 "wke" ,长度是3。请注意答案必须是一个子串,"pwke" 是 子序列 而不是子串。
The text was updated successfully, but these errors were encountered: