#leetcode #macro #definition #prelude #binary-tree #linked-list #exercising

leetcode_prelude

Some useful macros and definition for exercising in leetcode

5 releases

0.2.3 Aug 14, 2020
0.2.2 Feb 14, 2019
0.1.2 Dec 29, 2018
0.1.1 Dec 29, 2018
0.1.0 Dec 29, 2018

#17 in #leetcode

Download history 23/week @ 2024-08-26 53/week @ 2024-09-23 10/week @ 2024-09-30 8/week @ 2024-10-14 1/week @ 2024-10-28 2/week @ 2024-11-04 7/week @ 2024-11-25 22/week @ 2024-12-02 65/week @ 2024-12-09

94 downloads per month

MIT license

8KB
147 lines

leetcode_prelude

Some useful macros and definition for exercising in LeetCode.

How to use

Add following lines to your Cargo.toml.

[dependencies]
leetcode_prelude = "^0.2"

Examples

Binary tree initialization

use leetcode_prelude::btree;

let btree = btree![1, 2, 2, null, null, 3, 3];

Linked list initialization

use leetcode_prelude::linkedlist;

let linkedlist = linkedlist![1, 2, 3];

Generate test code from leetcode's json

use leetcode_prelude::leetcode_test;

leetcode_test!(
     ["Trie", "insert", "search"]
     [[], ["apple"], ["apple"]]
     [null, null, true]
)

Create a Vec<String>

use leetcode_prelude::vec_string;

let vec = vec_string!["1", "2", "3"];

assert_eq_sorted

use leetcode_prelude::assert_eq_sorted;

assert_eq_sorted!(vec![1, 2], vec![2, 1]);

Dependencies

~0.5–1MB
~20K SLoC