- the edit flow —— solution files will generate automatically!
- support Python script to filter questions
- doc support,
lc-rscan compile the annotation of your solutions to Markdown! - support local signal to keep coding as longer as you want
# Required dependencies:
#
# gcc
# libssl-dev
# libdbus-1-dev
# libsqlite3-dev
cargo install leetcode-cliIf this happens when compiling the program, it means that the package cannot be compiled with stable Rust. To fix this, install Rust Nightly and try the following:
rustup install nightly
cargo +nightly install leetcode-cliMake sure you have logged in to leetcode.com with Chrome. See Cookies for why you need to do this first.
leetcode 0.3.9
May the Code be with You 👻
USAGE:
leetcode [FLAGS] [SUBCOMMAND]
FLAGS:
-d, --debug debug mode
-h, --help Prints help information
-V, --version Prints version information
SUBCOMMANDS:
data Manage Cache [aliases: d]
edit Edit question by id [aliases: e]
exec Submit solution [aliases: x]
list List problems [aliases: l]
pick Pick a problem [aliases: p]
stat Show simple chart about submissions [aliases: s]
test Edit question by id [aliases: t]
help Prints this message or the help of the given subcommand(s)For example, given this config (can be found in ~/.leetcode/leetcode.toml):
[code]
lang = "rust"
editor = "emacs"leetcode pick 1[1] Two Sum is on the run...
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
--------------------------------------------------
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].leetcode edit 1# struct Solution;
impl Solution {
pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
use std::collections::HashMap;
let mut m: HashMap<i32, i32> = HashMap::new();
for (i, e) in nums.iter().enumerate() {
if let Some(v) = m.get(&(target - e)) {
return vec![*v, i as i32];
}
m.insert(*e, i as i32).unwrap_or_default();
}
return vec![];
}
}leetcode test 1 Accepted Runtime: 0 ms
Your input: [2,7,11,15], 9
Output: [0,1]
Expected: [0,1]
leetcode submit 1 Success
Runtime: 0 ms, faster than 100% of Rustonline submissions for Two Sum.
Memory Usage: 2.4 MB, less than 100% of Rustonline submissions for Two Sum.
The cookie plugin of leetcode-cli can work on OSX and Linux. If you are on a different platform, there are problems with caching the cookies, you can manually input your LeetCode Cookies to the configuration file.
[cookies]
csrf = "..."
session = "..."For Example, using Chrome (after logging in to LeetCode):
Open Chrome and navigate to the link below:
chrome://settings/cookies/detail?site=leetcode.comCopy Content from LEETCODE_SESSION and csrftoken to session and csrf in your configuration file, respectively:
[cookies]
csrf = "${csrftoken}"
session = "${LEETCODE_SESSION}"If you want to filter LeetCode questions using custom Python scripts, add the following to your the configuration file:
[storage]
scripts = "scripts"Then write the script:
# ~/.leetcode/scripts/plan1.py
import json;
def plan(sps, stags):
##
# `print` in python is supported,
# if you want to know the data structures of these two args,
# just print them
##
problems = json.loads(sps)
tags = json.loads(stags)
ret = []
tm = {}
for tag in tags:
tm[tag["tag"]] = tag["refs"];
for i in problems:
if i["level"] == 1 and str(i["id"]) in tm["linked-list"]:
ret.append(str(i["id"]))
# return is `List[string]`
return retThen run list with the filter that you just wrote:
leetcode list -p plan1And that's it! Enjoy!
PRs are more than welcome!
MIT