[INFO] cloning repository https://github.com/aylei/leetcode-rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/aylei/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faylei%2Fleetcode-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faylei%2Fleetcode-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] a65b4afdc32e7e3be9e4fe749c9a599dea507d4c [INFO] checking aylei/leetcode-rust against try#8e3afc79c11f48cb3acd1be5b3b7de98fe3f93a8 for pr-82565 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faylei%2Fleetcode-rust" "/workspace/builds/worker-4/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/aylei/leetcode-rust on toolchain 8e3afc79c11f48cb3acd1be5b3b7de98fe3f93a8 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+8e3afc79c11f48cb3acd1be5b3b7de98fe3f93a8" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-4/source/.cargo/config [INFO] started tweaking git repo https://github.com/aylei/leetcode-rust [INFO] finished tweaking git repo https://github.com/aylei/leetcode-rust [INFO] tweaked toml for git repo https://github.com/aylei/leetcode-rust written to /workspace/builds/worker-4/source/Cargo.toml [INFO] crate git repo https://github.com/aylei/leetcode-rust already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+8e3afc79c11f48cb3acd1be5b3b7de98fe3f93a8" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded indexmap v1.2.0 [INFO] [stderr] Downloaded flate2 v1.0.12 [INFO] [stderr] Downloaded futures-io v0.3.4 [INFO] [stderr] Downloaded futures-util v0.3.4 [INFO] [stderr] Downloaded futures-macro v0.3.4 [INFO] [stderr] Downloaded futures-channel v0.3.4 [INFO] [stderr] Downloaded openssl v0.10.25 [INFO] [stderr] Downloaded futures v0.3.4 [INFO] [stderr] Downloaded futures-executor v0.3.4 [INFO] [stderr] Downloaded wasm-bindgen-backend v0.2.58 [INFO] [stderr] Downloaded isahc v0.7.6 [INFO] [stderr] Downloaded wasm-bindgen-macro-support v0.2.58 [INFO] [stderr] Downloaded futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded anyhow v1.0.26 [INFO] [stderr] Downloaded futures-core v0.3.4 [INFO] [stderr] Downloaded futures-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded openssl-sys v0.9.50 [INFO] [stderr] Downloaded futures-task v0.3.4 [INFO] [stderr] Downloaded wasm-bindgen-futures v0.3.27 [INFO] [stderr] Downloaded sluice v0.4.2 [INFO] [stderr] Downloaded serde_json v1.0.41 [INFO] [stderr] Downloaded unicase v2.5.1 [INFO] [stderr] Downloaded libnghttp2-sys v0.1.2 [INFO] [stderr] Downloaded js-sys v0.3.35 [INFO] [stderr] Downloaded wasm-bindgen-macro v0.2.58 [INFO] [stderr] Downloaded bumpalo v3.1.2 [INFO] [stderr] Downloaded curl-sys v0.4.25 [INFO] [stderr] Downloaded reqwest v0.9.21 [INFO] [stderr] Downloaded iovec v0.1.3 [INFO] [stderr] Downloaded wasm-bindgen v0.2.58 [INFO] [stderr] Downloaded wasm-bindgen-shared v0.2.58 [INFO] [stderr] Downloaded web-sys v0.3.35 [INFO] [stderr] Downloaded wasm-bindgen-webidl v0.2.58 [INFO] [stderr] Downloaded mime v0.3.14 [INFO] [stderr] Downloaded futures-sink v0.3.4 [INFO] [stderr] Downloaded miniz_oxide v0.3.3 [INFO] [stderr] Downloaded surf v1.0.3 [INFO] [stderr] Downloaded tokio-reactor v0.1.10 [INFO] [stderr] Downloaded tokio-threadpool v0.1.16 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:f2f6bcd4b43ebee4e173f653a26493129bdb64017c85f916b780ca7fbdbaa79d" "/opt/rustwide/cargo-home/bin/cargo" "+8e3afc79c11f48cb3acd1be5b3b7de98fe3f93a8" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 7f701517438b1b58a5389de6a25a57d2ffa0aa6c196f685b944bf7c45f7a99c9 [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "7f701517438b1b58a5389de6a25a57d2ffa0aa6c196f685b944bf7c45f7a99c9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "7f701517438b1b58a5389de6a25a57d2ffa0aa6c196f685b944bf7c45f7a99c9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7f701517438b1b58a5389de6a25a57d2ffa0aa6c196f685b944bf7c45f7a99c9", kill_on_drop: false }` [INFO] [stdout] 7f701517438b1b58a5389de6a25a57d2ffa0aa6c196f685b944bf7c45f7a99c9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:f2f6bcd4b43ebee4e173f653a26493129bdb64017c85f916b780ca7fbdbaa79d" "/opt/rustwide/cargo-home/bin/cargo" "+8e3afc79c11f48cb3acd1be5b3b7de98fe3f93a8" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 1501f2fc3a4925bd401695675d30b087d775f30f7b4f0e12fe6b43977b6b498b [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "1501f2fc3a4925bd401695675d30b087d775f30f7b4f0e12fe6b43977b6b498b", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Compiling libc v0.2.62 [INFO] [stderr] Checking cfg-if v0.1.10 [INFO] [stderr] Compiling autocfg v0.1.6 [INFO] [stderr] Checking lazy_static v1.4.0 [INFO] [stderr] Compiling semver-parser v0.7.0 [INFO] [stderr] Compiling byteorder v1.3.2 [INFO] [stderr] Compiling pkg-config v0.3.16 [INFO] [stderr] Checking smallvec v0.6.10 [INFO] [stderr] Checking slab v0.4.2 [INFO] [stderr] Compiling proc-macro2 v1.0.5 [INFO] [stderr] Compiling unicode-xid v0.2.0 [INFO] [stderr] Compiling memchr v2.2.1 [INFO] [stderr] Compiling version_check v0.1.5 [INFO] [stderr] Checking itoa v0.4.4 [INFO] [stderr] Checking matches v0.1.8 [INFO] [stderr] Checking fnv v1.0.6 [INFO] [stderr] Checking scopeguard v1.0.0 [INFO] [stderr] Checking rand_core v0.4.2 [INFO] [stderr] Compiling proc-macro2 v0.4.30 [INFO] [stderr] Compiling arrayvec v0.4.11 [INFO] [stderr] Compiling serde v1.0.101 [INFO] [stderr] Checking nodrop v0.1.13 [INFO] [stderr] Checking futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling ryu v1.0.0 [INFO] [stderr] Checking rustc-demangle v0.1.16 [INFO] [stderr] Checking futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Checking percent-encoding v2.1.0 [INFO] [stderr] Compiling failure_derive v0.1.5 [INFO] [stderr] Checking percent-encoding v1.0.1 [INFO] [stderr] Compiling openssl v0.10.25 [INFO] [stderr] Compiling httparse v1.3.4 [INFO] [stderr] Compiling crc32fast v1.2.0 [INFO] [stderr] Checking try-lock v0.2.2 [INFO] [stderr] Compiling curl v0.4.25 [INFO] [stderr] Checking dtoa v0.4.4 [INFO] [stderr] Checking futures-core v0.3.4 [INFO] [stderr] Checking futures-sink v0.3.4 [INFO] [stderr] Checking regex-syntax v0.6.14 [INFO] [stderr] Compiling isahc v0.7.6 [INFO] [stderr] Checking mime v0.3.14 [INFO] [stderr] Checking futures-io v0.3.4 [INFO] [stderr] Compiling libnghttp2-sys v0.1.2 [INFO] [stderr] Checking try_from v0.3.2 [INFO] [stderr] Checking unicode-bidi v0.3.4 [INFO] [stderr] Checking crossbeam-utils v0.6.6 [INFO] [stderr] Checking thread_local v1.0.1 [INFO] [stderr] Checking tokio-sync v0.1.6 [INFO] [stderr] Compiling semver v0.9.0 [INFO] [stderr] Checking lock_api v0.3.1 [INFO] [stderr] Checking rand_core v0.3.1 [INFO] [stderr] Checking rand_jitter v0.1.4 [INFO] [stderr] Checking unicode-normalization v0.1.8 [INFO] [stderr] Checking futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling unicase v2.5.1 [INFO] [stderr] Compiling error-chain v0.12.1 [INFO] [stderr] Compiling rand_chacha v0.1.1 [INFO] [stderr] Compiling rand_pcg v0.1.2 [INFO] [stderr] Compiling rand v0.6.5 [INFO] [stderr] Checking miniz_oxide v0.3.3 [INFO] [stderr] Checking log v0.4.8 [INFO] [stderr] Checking futures-channel v0.3.4 [INFO] [stderr] Compiling openssl-sys v0.9.50 [INFO] [stderr] Compiling libz-sys v1.0.25 [INFO] [stderr] Compiling curl-sys v0.4.25 [INFO] [stderr] Checking rand_isaac v0.1.1 [INFO] [stderr] Checking rand_xorshift v0.1.1 [INFO] [stderr] Checking rand_hc v0.1.0 [INFO] [stderr] Compiling rustc_version v0.2.3 [INFO] [stderr] Checking encoding_rs v0.8.20 [INFO] [stderr] Checking tokio-executor v0.1.8 [INFO] [stderr] Checking crossbeam-queue v0.1.2 [INFO] [stderr] Checking crossbeam-channel v0.3.9 [INFO] [stderr] Checking sluice v0.4.2 [INFO] [stderr] Checking want v0.2.0 [INFO] [stderr] Checking tokio-timer v0.2.11 [INFO] [stderr] Checking tokio-current-thread v0.1.6 [INFO] [stderr] Checking base64 v0.10.1 [INFO] [stderr] Compiling quote v1.0.2 [INFO] [stderr] Compiling parking_lot_core v0.6.2 [INFO] [stderr] Compiling memoffset v0.5.1 [INFO] [stderr] Compiling parking_lot v0.9.0 [INFO] [stderr] Compiling hyper v0.12.35 [INFO] [stderr] Checking iovec v0.1.3 [INFO] [stderr] Checking num_cpus v1.10.1 [INFO] [stderr] Checking net2 v0.2.33 [INFO] [stderr] Checking backtrace-sys v0.1.31 [INFO] [stderr] Checking time v0.1.42 [INFO] [stderr] Checking rand_os v0.1.3 [INFO] [stderr] Checking socket2 v0.3.11 [INFO] [stderr] Compiling quote v0.6.13 [INFO] [stderr] Checking flate2 v1.0.12 [INFO] [stderr] Checking aho-corasick v0.7.6 [INFO] [stderr] Checking idna v0.2.0 [INFO] [stderr] Checking idna v0.1.5 [INFO] [stderr] Checking futures-cpupool v0.1.8 [INFO] [stderr] Checking backtrace v0.3.38 [INFO] [stderr] Checking bytes v0.4.12 [INFO] [stderr] Compiling syn v1.0.5 [INFO] [stderr] Checking mio v0.6.19 [INFO] [stderr] Compiling native-tls v0.2.3 [INFO] [stderr] Compiling syn v0.15.44 [INFO] [stderr] Compiling mime_guess v2.0.1 [INFO] [stderr] Checking crossbeam-epoch v0.7.2 [INFO] [stderr] Checking tokio-io v0.1.12 [INFO] [stderr] Checking http v0.1.18 [INFO] [stderr] Checking string v0.2.1 [INFO] [stderr] Checking tokio-buf v0.1.1 [INFO] [stderr] Checking url v1.7.2 [INFO] [stderr] Checking url v2.1.0 [INFO] [stderr] Checking regex v1.3.4 [INFO] [stderr] Checking futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Checking crossbeam-deque v0.7.1 [INFO] [stderr] Checking tokio-reactor v0.1.10 [INFO] [stderr] Checking tokio-threadpool v0.1.16 [INFO] [stderr] Checking uuid v0.7.4 [INFO] [stderr] Checking tokio-tcp v0.1.3 [INFO] [stderr] Checking cookie v0.12.0 [INFO] [stderr] Checking tokio v0.1.22 [INFO] [stderr] Checking publicsuffix v1.5.3 [INFO] [stderr] Compiling synstructure v0.10.2 [INFO] [stderr] Checking h2 v0.1.26 [INFO] [stderr] Checking http-body v0.1.0 [INFO] [stderr] Checking futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling serde_derive v1.0.101 [INFO] [stderr] Compiling proc-macro-hack v0.5.11 [INFO] [stderr] Checking failure v0.1.5 [INFO] [stderr] Compiling futures-macro v0.3.4 [INFO] [stderr] Checking hyper-tls v0.3.2 [INFO] [stderr] Checking futures-util v0.3.4 [INFO] [stderr] Checking futures-executor v0.3.4 [INFO] [stderr] Checking futures v0.3.4 [INFO] [stderr] Checking serde_json v1.0.41 [INFO] [stderr] Checking serde_urlencoded v0.6.1 [INFO] [stderr] Checking serde_urlencoded v0.5.5 [INFO] [stderr] Checking cookie_store v0.7.0 [INFO] [stderr] Checking surf v1.0.3 [INFO] [stderr] Checking reqwest v0.9.21 [INFO] [stderr] Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:20:32 [INFO] [stdout] | [INFO] [stdout] 20 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:24:32 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:14:32 [INFO] [stdout] | [INFO] [stdout] 14 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:20:32 [INFO] [stdout] | [INFO] [stdout] 20 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:20:32 [INFO] [stdout] | [INFO] [stdout] 20 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::char::from_digit` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:49:5 [INFO] [stdout] | [INFO] [stdout] 49 | use std::char::from_digit; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:29:32 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/solution/s0068_text_justification.rs:106:85 [INFO] [stdout] | [INFO] [stdout] 106 | let mut extra_spaces = spaces - avg_spaces * usize::max(1, words.len() - 1);; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (target > matrix[mid / width][mid % width]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:22:32 [INFO] [stdout] | [INFO] [stdout] 22 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:22:32 [INFO] [stdout] | [INFO] [stdout] 22 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0086_partition_list.rs:17:32 [INFO] [stdout] | [INFO] [stdout] 17 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:17:32 [INFO] [stdout] | [INFO] [stdout] 17 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:54:25 [INFO] [stdout] | [INFO] [stdout] 54 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:58:25 [INFO] [stdout] | [INFO] [stdout] 58 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0100_same_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:24:32 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0112_path_sum.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:22:32 [INFO] [stdout] | [INFO] [stdout] 22 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:21:32 [INFO] [stdout] | [INFO] [stdout] 21 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:63:23 [INFO] [stdout] | [INFO] [stdout] 63 | match (t as &str) { [INFO] [stdout] | ^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (nums[mid] > nums[hi]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:57:23 [INFO] [stdout] | [INFO] [stdout] 57 | } else if (nums[mid] < nums[hi]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:21:25 [INFO] [stdout] | [INFO] [stdout] 21 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:15:32 [INFO] [stdout] | [INFO] [stdout] 15 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::hash_map::Entry` [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:41:5 [INFO] [stdout] | [INFO] [stdout] 41 | use std::collections::hash_map::Entry; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:19:32 [INFO] [stdout] | [INFO] [stdout] 19 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:59:18 [INFO] [stdout] | [INFO] [stdout] 59 | for i in (prev + 1..=9) { [INFO] [stdout] | ^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:36:13 [INFO] [stdout] | [INFO] [stdout] 36 | (rect1.0 + rect2.0 - (center1.0 - center2.0).abs()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | (rect1.1 + rect2.1 - (center1.1 - center2.1).abs()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated function `std::mem::uninitialized`: use `mem::MaybeUninit` instead [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:83:51 [INFO] [stdout] | [INFO] [stdout] 83 | head: unsafe { Box::into_raw(Box::new(mem::uninitialized::())) }, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated function `std::mem::uninitialized`: use `mem::MaybeUninit` instead [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:84:51 [INFO] [stdout] | [INFO] [stdout] 84 | tail: unsafe { Box::into_raw(Box::new(mem::uninitialized::())) }, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:36:9 [INFO] [stdout] | [INFO] [stdout] 35 | loop {} [INFO] [stdout] | ------- any code following this expression is unreachable [INFO] [stdout] 36 | s[result.0..result.1].to_owned() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:48:9 [INFO] [stdout] | [INFO] [stdout] 48 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:47:9 [INFO] [stdout] | [INFO] [stdout] 47 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:87:9 [INFO] [stdout] | [INFO] [stdout] 87 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::char::from_digit` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:49:5 [INFO] [stdout] | [INFO] [stdout] 49 | use std::char::from_digit; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:72:9 [INFO] [stdout] | [INFO] [stdout] 72 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:29:32 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:46:9 [INFO] [stdout] | [INFO] [stdout] 46 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/solution/s0068_text_justification.rs:106:85 [INFO] [stdout] | [INFO] [stdout] 106 | let mut extra_spaces = spaces - avg_spaces * usize::max(1, words.len() - 1);; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (target > matrix[mid / width][mid % width]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:52:9 [INFO] [stdout] | [INFO] [stdout] 52 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:48:9 [INFO] [stdout] | [INFO] [stdout] 48 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:22:32 [INFO] [stdout] | [INFO] [stdout] 22 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:22:32 [INFO] [stdout] | [INFO] [stdout] 22 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:81:9 [INFO] [stdout] | [INFO] [stdout] 81 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:48:9 [INFO] [stdout] | [INFO] [stdout] 48 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:17:32 [INFO] [stdout] | [INFO] [stdout] 17 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:50:9 [INFO] [stdout] | [INFO] [stdout] 50 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:31:9 [INFO] [stdout] | [INFO] [stdout] 31 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:54:25 [INFO] [stdout] | [INFO] [stdout] 54 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:22:32 [INFO] [stdout] | [INFO] [stdout] 22 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:46:9 [INFO] [stdout] | [INFO] [stdout] 46 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:63:23 [INFO] [stdout] | [INFO] [stdout] 63 | match (t as &str) { [INFO] [stdout] | ^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (nums[mid] > nums[hi]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:57:23 [INFO] [stdout] | [INFO] [stdout] 57 | } else if (nums[mid] < nums[hi]) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:47:9 [INFO] [stdout] | [INFO] [stdout] 47 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::hash_map::Entry` [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:41:5 [INFO] [stdout] | [INFO] [stdout] 41 | use std::collections::hash_map::Entry; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:116:9 [INFO] [stdout] | [INFO] [stdout] 116 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:36:9 [INFO] [stdout] | [INFO] [stdout] 36 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:59:18 [INFO] [stdout] | [INFO] [stdout] 59 | for i in (prev + 1..=9) { [INFO] [stdout] | ^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:42:9 [INFO] [stdout] | [INFO] [stdout] 42 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:36:13 [INFO] [stdout] | [INFO] [stdout] 36 | (rect1.0 + rect2.0 - (center1.0 - center2.0).abs()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | (rect1.1 + rect2.1 - (center1.1 - center2.1).abs()), [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:32:9 [INFO] [stdout] | [INFO] [stdout] 32 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:57:9 [INFO] [stdout] | [INFO] [stdout] 57 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:57:9 [INFO] [stdout] | [INFO] [stdout] 57 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable statement [INFO] [stdout] --> src/solution/s0202_happy_number.rs:43:9 [INFO] [stdout] | [INFO] [stdout] 32 | / loop { [INFO] [stdout] 33 | | set.insert(n); [INFO] [stdout] 34 | | let temp = Solution::next(n); [INFO] [stdout] 35 | | if temp == 1 { [INFO] [stdout] ... | [INFO] [stdout] 41 | | n = temp [INFO] [stdout] 42 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 43 | return false; [INFO] [stdout] | ^^^^^^^^^^^^^ unreachable statement [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums1` [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:38:38 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums2` [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:38:55 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `digit` is never read [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let mut digit: i64 = 0; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:79:21 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:79:32 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_p` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr_area` is never read [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut curr_area: i32 = 0; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dividend` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:39:19 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dividend` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `divisor` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:39:34 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_divisor` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `substr_len` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:70:13 [INFO] [stdout] | [INFO] [stdout] 70 | let substr_len = word_len * words.len(); [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_substr_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `entry` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:110:35 [INFO] [stdout] | [INFO] [stdout] 110 | Entry::Vacant(entry) => { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_entry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:32:41 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:46:26 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:46:42 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn solve_sudoku(board: &mut Vec>) {} [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:25:17 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `carry` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut carry = 0_u32; [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_carry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:48:14 [INFO] [stdout] | [INFO] [stdout] 48 | for (i, multiplier) in num1.into_iter().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `multiplier` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:48:17 [INFO] [stdout] | [INFO] [stdout] 48 | for (i, multiplier) in num1.into_iter().enumerate() { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_multiplier` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `multiplicand` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:52:18 [INFO] [stdout] | [INFO] [stdout] 52 | for &multiplicand in num2.iter() {} [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_multiplicand` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:78:21 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:78:32 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_p` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:32:17 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:28:13 [INFO] [stdout] | [INFO] [stdout] 28 | let mut j = 0_usize; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:37:54 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:47:22 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn is_number(s: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:50:13 [INFO] [stdout] | [INFO] [stdout] 50 | for i in 2..n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word1` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_word1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word2` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:40 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_word2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:57:23 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn set_zeroes(matrix: &mut Vec>) {} [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:14 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `end` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_end` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | let mut result = (0_usize, 0_usize); [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:55:30 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:39:19 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:39:35 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:46:30 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:46:30 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:28:30 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s1` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:72:24 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:72:36 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:39:26 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:28 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `m` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:57 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_m` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:65 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:22:33 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `val` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:63:13 [INFO] [stdout] | [INFO] [stdout] 63 | for val in 2..n + 1 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_val` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `parent` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:71:21 [INFO] [stdout] | [INFO] [stdout] 71 | let mut parent = dummy.as_ref().unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_parent` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:72:21 [INFO] [stdout] | [INFO] [stdout] 72 | let mut node = root; [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:30:22 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `trans` [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:81:13 [INFO] [stdout] | [INFO] [stdout] 81 | for trans in 0..max_trans { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_trans` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `gas` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:64:33 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_gas` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cost` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:64:48 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_cost` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word_dict` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:59:34 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_word_dict` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn reorder_list(head: &mut Option>) { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:51:32 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut mid = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:43:13 [INFO] [stdout] | [INFO] [stdout] 43 | let mut mid = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `numerator` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:38:32 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_numerator` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `denominator` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:38:48 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_denominator` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:49:28 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn title_to_number(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `words` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:44:46 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_words` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn shortest_palindrome(s: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `buildings` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:33:24 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn get_skyline(buildings: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_buildings` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:23:28 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn count_digit_one(n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:48:28 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn number_to_words(num: i32) -> String { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:48:26 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:48:39 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max` [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | let mut max = 0; [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated function `std::mem::uninitialized`: use `mem::MaybeUninit` instead [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:83:51 [INFO] [stdout] | [INFO] [stdout] 83 | head: unsafe { Box::into_raw(Box::new(mem::uninitialized::())) }, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated function `std::mem::uninitialized`: use `mem::MaybeUninit` instead [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:84:51 [INFO] [stdout] | [INFO] [stdout] 84 | tail: unsafe { Box::into_raw(Box::new(mem::uninitialized::())) }, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0015_3sum.rs:48:17 [INFO] [stdout] | [INFO] [stdout] 48 | let mut vec = Solution::two_sum(&nums[(i + 1)..len], 0 - nums[i]); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut next = right.as_mut().unwrap().next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | let mut tail = end.as_mut().unwrap().next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | mut head: Option>, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:72:17 [INFO] [stdout] | [INFO] [stdout] 72 | let mut next = current_node_inner.next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | let mut vec = Vec::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:59:9 [INFO] [stdout] | [INFO] [stdout] 59 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut vec = Vec::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut carry = 0_u32; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0046_permutations.rs:36:21 [INFO] [stdout] | [INFO] [stdout] 36 | let mut sub = nums.clone().into_iter().filter(|&x| x != num).collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:33:16 [INFO] [stdout] | [INFO] [stdout] 33 | fn permute(mut nums: Vec) -> Vec> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:83:13 [INFO] [stdout] | [INFO] [stdout] 83 | let mut matrix = matrix; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:28:13 [INFO] [stdout] | [INFO] [stdout] 28 | let mut j = 0_usize; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:53:13 [INFO] [stdout] | [INFO] [stdout] 53 | let mut k = k; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:55:13 [INFO] [stdout] | [INFO] [stdout] 55 | let mut res = String::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:14 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | let mut result = (0_usize, 0_usize); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | let mut max_area = 0; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0086_partition_list.rs:32:17 [INFO] [stdout] | [INFO] [stdout] 32 | let mut next = inner.next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut next = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:66:21 [INFO] [stdout] | [INFO] [stdout] 66 | let mut dummy = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:71:21 [INFO] [stdout] | [INFO] [stdout] 71 | let mut parent = dummy.as_ref().unwrap().clone(); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:72:21 [INFO] [stdout] | [INFO] [stdout] 72 | let mut node = root; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | let mut right = node.borrow().right.clone(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:113:29 [INFO] [stdout] | [INFO] [stdout] 113 | let mut prev = &mut paths[j].1; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:44:22 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn sort_list(mut head: Option>) -> Option> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:64:13 [INFO] [stdout] | [INFO] [stdout] 64 | let mut l2 = next.unwrap().next.take(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:65:13 [INFO] [stdout] | [INFO] [stdout] 65 | let mut l1 = Solution::merge_sort(head, len / 2); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | let mut l2 = Solution::merge_sort(l2, len - len / 2); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:92:23 [INFO] [stdout] | [INFO] [stdout] 92 | (Some(mut node1), None) => { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:96:29 [INFO] [stdout] | [INFO] [stdout] 96 | (None, Some(mut node2)) => { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:100:13 [INFO] [stdout] | [INFO] [stdout] 100 | let mut set: HashSet = HashSet::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:55:26 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn reverse_words(mut s: String) -> String { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0198_house_robber.rs:48:17 [INFO] [stdout] | [INFO] [stdout] 48 | let mut temp = curr_max; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let mut seed = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:52:54 [INFO] [stdout] | [INFO] [stdout] 52 | fn helper(distance: i32, prev: i32, remain: i32, mut curr: Vec, res: &mut Vec>) { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:42:13 [INFO] [stdout] | [INFO] [stdout] 42 | let mut chs: Vec = s.chars().collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0306_additive_number.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | let mut chs: Vec = num.chars().map(|c| c.to_digit(10).unwrap()).collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | let mut max = 0; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary `unsafe` block [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:99:34 [INFO] [stdout] | [INFO] [stdout] 99 | (Some(ptr), Some(unsafe { (*entry).val })) [INFO] [stdout] | ^^^^^^ unnecessary `unsafe` block [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_unsafe)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0001_two_sum.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/solution/s0001_two_sum.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_two_numbers` [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0003_longest_substring_without_repeating_characters.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 13 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_longest_substring` [INFO] [stdout] --> src/solution/s0003_longest_substring_without_repeating_characters.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_median_sorted_arrays` [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0005_longest_palindromic_substring.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_palindrome` [INFO] [stdout] --> src/solution/s0005_longest_palindromic_substring.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0006_zigzag_conversion.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert` [INFO] [stdout] --> src/solution/s0006_zigzag_conversion.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0008_string_to_integer_atoi.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_atoi` [INFO] [stdout] --> src/solution/s0008_string_to_integer_atoi.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn my_atoi(input: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0009_palindrome_number.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/solution/s0009_palindrome_number.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:79:12 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_area` [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min` [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn min(i: i32, j: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0012_integer_to_roman.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `int_to_roman` [INFO] [stdout] --> src/solution/s0012_integer_to_roman.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn int_to_roman(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0013_roman_to_integer.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `roman_to_int` [INFO] [stdout] --> src/solution/s0013_roman_to_integer.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0014_longest_common_prefix.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_common_prefix` [INFO] [stdout] --> src/solution/s0014_longest_common_prefix.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0015_3sum.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum` [INFO] [stdout] --> src/solution/s0015_3sum.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/solution/s0015_3sum.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn two_sum(nums: &[i32], sum: i32) -> Vec<(i32, i32)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_unique` [INFO] [stdout] --> src/solution/s0015_3sum.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `three_sum_closest` [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum_closest` [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn two_sum_closest(nums: &[i32], target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0017_letter_combinations_of_a_phone_number.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `letter_combinations` [INFO] [stdout] --> src/solution/s0017_letter_combinations_of_a_phone_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0018_4sum.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `four_sum` [INFO] [stdout] --> src/solution/s0018_4sum.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn four_sum(nums: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_nth_from_end` [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid` [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pair` [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn pair(open: char, close: char) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 13 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_two_lists` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `take_head` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | fn take_head(mut l: Option>) -> (Option>, Option>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_parenthesis` [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn dfs(n: i32, left: i32, right: i32, result: &mut Vec, mut path: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_k_lists` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn next( [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `swap_pairs` [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_k_group` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn reverse_k_group(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn reverse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0026_remove_duplicates_from_sorted_array.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates` [INFO] [stdout] --> src/solution/s0026_remove_duplicates_from_sorted_array.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0027_remove_element.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_element` [INFO] [stdout] --> src/solution/s0027_remove_element.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0028_implement_strstr.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `str_str` [INFO] [stdout] --> src/solution/s0028_implement_strstr.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `divide` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Term` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Term { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn new(expect: i32, count: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inc_expect` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn inc_expect(&mut self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inc` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | fn inc(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dec` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | fn dec(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `exhausted` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn exhausted(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reset` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn reset(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_substring` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0031_next_permutation.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next_permutation` [INFO] [stdout] --> src/solution/s0031_next_permutation.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_valid_parentheses` [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn longest_valid_parentheses(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest` [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | fn longest(seq: &Vec, plus_char: char) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0033_search_in_rotated_sorted_array.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/solution/s0033_search_in_rotated_sorted_array.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_range` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_insert` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 65 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_sudoku` [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `solve_sudoku` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn solve_sudoku(board: &mut Vec>) {} [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0038_count_and_say.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_and_say` [INFO] [stdout] --> src/solution/s0038_count_and_say.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combination_sum` [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtrack` [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combination_sum2` [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn combination_sum2(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtrack` [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0041_first_missing_positive.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `first_missing_positive` [INFO] [stdout] --> src/solution/s0041_first_missing_positive.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn first_missing_positive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trap` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `multiply` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn multiply(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0046_permutations.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute` [INFO] [stdout] --> src/solution/s0046_permutations.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute_unique` [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn permute_unique(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute` [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | fn permute(mut nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:82:12 [INFO] [stdout] | [INFO] [stdout] 82 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `group_anagrams` [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0050_powx_n.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_pow` [INFO] [stdout] --> src/solution/s0050_powx_n.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn my_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0051_n_queens.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `solve_n_queens` [INFO] [stdout] --> src/solution/s0051_n_queens.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn solve_n_queens(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `schedule_queens` [INFO] [stdout] --> src/solution/s0051_n_queens.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn schedule_queens( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `collision` [INFO] [stdout] --> src/solution/s0051_n_queens.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn collision(board: &Vec>, len: usize, x: usize, y: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `total_n_queens` [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn total_n_queens(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `schedule_queens` [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | fn schedule_queens(board: &mut Vec>, num: &mut i32, len: usize, row: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `collision` [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn collision(board: &Vec>, len: usize, x: usize, y: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sub_array` [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0054_spiral_matrix.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `spiral_order` [INFO] [stdout] --> src/solution/s0054_spiral_matrix.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn spiral_order(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0055_jump_game.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_jump` [INFO] [stdout] --> src/solution/s0055_jump_game.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn new(start: i32, end: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn merge(intervals: Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn new(start: i32, end: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn insert(intervals: Vec, new_interval: Interval) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0058_length_of_last_word.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_last_word` [INFO] [stdout] --> src/solution/s0058_length_of_last_word.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn length_of_last_word(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_matrix` [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn generate_matrix(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_permutation` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn get_permutation(n: i32, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate_right` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths` [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `partial_factorial` [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn partial_factorial(start: u64, mut end: u64) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0063_unique_paths_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unique_paths_with_obstacles` [INFO] [stdout] --> src/solution/s0063_unique_paths_ii.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_path_sum` [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_number` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn is_number(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0066_plus_one.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `plus_one` [INFO] [stdout] --> src/solution/s0066_plus_one.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0067_add_binary.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_binary` [INFO] [stdout] --> src/solution/s0067_add_binary.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn add_binary(a: String, b: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0068_text_justification.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `full_justify` [INFO] [stdout] --> src/solution/s0068_text_justification.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn full_justify(words: Vec, max_width: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `compact` [INFO] [stdout] --> src/solution/s0068_text_justification.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | fn compact(words: Vec, max_width: usize, row_len: usize) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `compact_last` [INFO] [stdout] --> src/solution/s0068_text_justification.rs:121:8 [INFO] [stdout] | [INFO] [stdout] 121 | fn compact_last(words: Vec, max_width: usize) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0069_sqrtx.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `my_sqrt` [INFO] [stdout] --> src/solution/s0069_sqrtx.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `climb_stairs` [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0071_simplify_path.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `simplify_path` [INFO] [stdout] --> src/solution/s0071_simplify_path.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn simplify_path(path: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_distance` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zeroes` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn set_zeroes(matrix: &mut Vec>) {} [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_matrix` [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort_colors` [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_window` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_char` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn count_char(s: String) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0077_combinations.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combine` [INFO] [stdout] --> src/solution/s0077_combinations.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtrack` [INFO] [stdout] --> src/solution/s0077_combinations.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | fn backtrack(start: i32, end: i32, k: i32, curr: Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0078_subsets.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subsets` [INFO] [stdout] --> src/solution/s0078_subsets.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtrack` [INFO] [stdout] --> src/solution/s0078_subsets.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn backtrack(start: usize, mut curr: Vec, nums: &Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0079_word_search.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `exist` [INFO] [stdout] --> src/solution/s0079_word_search.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/solution/s0079_word_search.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_duplicates` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_duplicates` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0084_largest_rectangle_in_histogram.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_rectangle_area` [INFO] [stdout] --> src/solution/s0084_largest_rectangle_in_histogram.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn largest_rectangle_area(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `maximal_rectangle` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0086_partition_list.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `partition` [INFO] [stdout] --> src/solution/s0086_partition_list.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn partition(head: Option>, x: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_scramble` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0088_merge_sorted_array.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/solution/s0088_merge_sorted_array.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0089_gray_code.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `gray_code` [INFO] [stdout] --> src/solution/s0089_gray_code.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn gray_code(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `subsets_with_dup` [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn subsets_with_dup(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `backtrack` [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_decodings` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_between` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `restore_ip_addresses` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traversal` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `inorder_traverse` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn inorder_traverse(root: Option<&Rc>>, consumer: &mut F) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_trees` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn generate_trees(n: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_trees` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_interleave` [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn is_interleave(s1: String, s2: String, s3: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_valid_bst` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_traverse` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | fn preorder_traverse( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recover_tree` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 90 | pub fn recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `recover_helper` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:94:8 [INFO] [stdout] | [INFO] [stdout] 94 | fn recover_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0100_same_tree.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_same_tree` [INFO] [stdout] --> src/solution/s0100_same_tree.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn is_same_tree( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_symmetric` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `symmetric_helper` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn symmetric_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order` [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `zigzag_level_order` [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_depth` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `depth_helper` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn depth_helper(root: Option<&Rc>>, max: &mut i32, curr: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree_helper` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | fn build_tree_helper(preorder: &[i32], inorder: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build_tree_helper` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | fn build_tree_helper(postorder: &[i32], inorder: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `level_order_bottom` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_array_to_bst` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `bst_helper` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn bst_helper(nums: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sorted_list_to_bst` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn sorted_list_to_bst(head: Option>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `bst_helper` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | fn bst_helper(nums: &[i32]) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_balanced` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `balanced_helper` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn balanced_helper(root: Option<&Rc>>) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_depth` [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0112_path_sum.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_path_sum` [INFO] [stdout] --> src/solution/s0112_path_sum.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn has_path_sum(root: Option>>, sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `path_sum` [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn path_sum(root: Option>>, sum: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `flatten` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `flatten_helper` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn flatten_helper(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0115_distinct_subsequences.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_distinct` [INFO] [stdout] --> src/solution/s0115_distinct_subsequences.rs:80:12 [INFO] [stdout] | [INFO] [stdout] 80 | pub fn num_distinct(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0118_pascals_triangle.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate` [INFO] [stdout] --> src/solution/s0118_pascals_triangle.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0119_pascals_triangle_ii.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_row` [INFO] [stdout] --> src/solution/s0119_pascals_triangle_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn get_row(row_index: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0120_triangle.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `minimum_total` [INFO] [stdout] --> src/solution/s0120_triangle.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0121_best_time_to_buy_and_sell_stock.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/solution/s0121_best_time_to_buy_and_sell_stock.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_path_sum` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `postorder` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn postorder(root: Option<&Rc>>, max: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0125_valid_palindrome.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/solution/s0125_valid_palindrome.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_ladders` [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn find_ladders( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:127:8 [INFO] [stdout] | [INFO] [stdout] 127 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `connect` [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:145:8 [INFO] [stdout] | [INFO] [stdout] 145 | fn connect(s1: &str, s2: &str) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `ladder_length` [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `connect` [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 88 | fn connect(s1: &str, s2: &str) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `longest_consecutive` [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sum_numbers` [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `solve` [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn solve(board: &mut Vec>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `dfs` [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | fn dfs(i: usize, j: usize, height: usize, width: usize, board: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0131_palindrome_partitioning.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `partition` [INFO] [stdout] --> src/solution/s0131_palindrome_partitioning.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/solution/s0131_palindrome_partitioning.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn is_palindrome( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_cut` [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn min_cut(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn is_palindrome( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_complete_circuit` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0135_candy.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `candy` [INFO] [stdout] --> src/solution/s0135_candy.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn candy(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0136_single_number.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_number` [INFO] [stdout] --> src/solution/s0136_single_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0137_single_number_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_number` [INFO] [stdout] --> src/solution/s0137_single_number_ii.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0139_word_break.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `word_break` [INFO] [stdout] --> src/solution/s0139_word_break.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `word_break` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reorder_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn reorder_list(head: &mut Option>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `preorder_traversal` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn helper(root: Option>>, vec: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `postorder_traversal` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn helper(root: Option>>, vec: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LRUEntry` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct LRUEntry { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn new(key: i32, val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `LRUCache` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:77:12 [INFO] [stdout] | [INFO] [stdout] 77 | pub fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:94:12 [INFO] [stdout] | [INFO] [stdout] 94 | pub fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `put` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:110:12 [INFO] [stdout] | [INFO] [stdout] 110 | pub fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:141:8 [INFO] [stdout] | [INFO] [stdout] 141 | fn pop(&mut self) -> Option> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:155:8 [INFO] [stdout] | [INFO] [stdout] 155 | fn push(&mut self, entry: *mut LRUEntry) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `detach` [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:167:8 [INFO] [stdout] | [INFO] [stdout] 167 | fn detach(&mut self, entry: *mut LRUEntry) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insertion_sort_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sort_list` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn sort_list(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge_sort` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | fn merge_sort(mut head: Option>, len: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn merge( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | fn new(p1: &Point, p2: &Point) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains` [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | fn contains(&self, p: &Point) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_points` [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:83:12 [INFO] [stdout] | [INFO] [stdout] 83 | pub fn max_points(points: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `eval_rpn` [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_words` [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn reverse_words(mut s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0152_maximum_product_subarray.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_product` [INFO] [stdout] --> src/solution/s0152_maximum_product_subarray.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0153_find_minimum_in_rotated_sorted_array.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min` [INFO] [stdout] --> src/solution/s0153_find_minimum_in_rotated_sorted_array.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min` [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MinStack` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:75:12 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_min` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:85:12 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn get_min(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_peak_element` [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `maximum_gap` [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn maximum_gap(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0165_compare_version_numbers.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `compare_version` [INFO] [stdout] --> src/solution/s0165_compare_version_numbers.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn compare_version(version1: String, version2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fraction_to_decimal` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0167_two_sum_ii_input_array_is_sorted.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `two_sum` [INFO] [stdout] --> src/solution/s0167_two_sum_ii_input_array_is_sorted.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0168_excel_sheet_column_title.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `convert_to_title` [INFO] [stdout] --> src/solution/s0168_excel_sheet_column_title.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn convert_to_title(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0169_majority_element.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element` [INFO] [stdout] --> src/solution/s0169_majority_element.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `title_to_number` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn title_to_number(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0172_factorial_trailing_zeroes.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trailing_zeroes` [INFO] [stdout] --> src/solution/s0172_factorial_trailing_zeroes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BSTIterator` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `has_next` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:85:12 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0174_dungeon_game.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calculate_minimum_hp` [INFO] [stdout] --> src/solution/s0174_dungeon_game.rs:79:12 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn calculate_minimum_hp(dungeon: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0179_largest_number.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `largest_number` [INFO] [stdout] --> src/solution/s0179_largest_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn largest_number(nums: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0187_repeated_dna_sequences.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_repeated_dna_sequences` [INFO] [stdout] --> src/solution/s0187_repeated_dna_sequences.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn find_repeated_dna_sequences(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn max_profit(k: i32, prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0189_rotate_array.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate` [INFO] [stdout] --> src/solution/s0189_rotate_array.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0198_house_robber.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/solution/s0198_house_robber.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `right_side_view` [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_islands` [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_parent` [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn get_parent(parent: &mut Vec>, p: (usize, usize)) -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `union` [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | fn union(parent: &mut Vec>, p1: (usize, usize), p2: (usize, usize)) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0201_bitwise_and_of_numbers_range.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `range_bitwise_and` [INFO] [stdout] --> src/solution/s0201_bitwise_and_of_numbers_range.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn range_bitwise_and(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0202_happy_number.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_happy` [INFO] [stdout] --> src/solution/s0202_happy_number.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `next` [INFO] [stdout] --> src/solution/s0202_happy_number.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn next(n: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_elements` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn remove_elements(mut head: Option>, val: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0204_count_primes.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_primes` [INFO] [stdout] --> src/solution/s0204_count_primes.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn count_primes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_isomorphic` [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `code` [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn code(s: String) -> String { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_list` [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0207_course_schedule.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_finish` [INFO] [stdout] --> src/solution/s0207_course_schedule.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `is_end` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | is_end: bool, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `nodes` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:37:5 [INFO] [stdout] | [INFO] [stdout] 37 | nodes: [Option>; 26], [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `starts_with` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn find(&self, word: String) -> Option<&Trie> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0209_minimum_size_subarray_sum.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_sub_array_len` [INFO] [stdout] --> src/solution/s0209_minimum_size_subarray_sum.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn min_sub_array_len(s: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0210_course_schedule_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_order` [INFO] [stdout] --> src/solution/s0210_course_schedule_ii.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WordDictionary` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `is_end` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:42:5 [INFO] [stdout] | [INFO] [stdout] 42 | is_end: bool, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `marked` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | marked: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `nodes` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:44:5 [INFO] [stdout] | [INFO] [stdout] 44 | nodes: [Option>; 26], [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_words` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rob` [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `shortest_palindrome` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn shortest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0215_kth_largest_element_in_an_array.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_kth_largest` [INFO] [stdout] --> src/solution/s0215_kth_largest_element_in_an_array.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn find_kth_largest(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `combination_sum3` [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn combination_sum3(k: i32, n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | fn helper(distance: i32, prev: i32, remain: i32, mut curr: Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0217_contains_duplicate.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains_duplicate` [INFO] [stdout] --> src/solution/s0217_contains_duplicate.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_skyline` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn get_skyline(buildings: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0219_contains_duplicate_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains_nearby_duplicate` [INFO] [stdout] --> src/solution/s0219_contains_duplicate_ii.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0220_contains_duplicate_iii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `contains_nearby_almost_duplicate` [INFO] [stdout] --> src/solution/s0220_contains_duplicate_iii.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn contains_nearby_almost_duplicate(nums: Vec, k: i32, t: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0221_maximal_square.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `maximal_square` [INFO] [stdout] --> src/solution/s0221_maximal_square.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn maximal_square(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_nodes` [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `compute_area` [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn compute_area(a: i32, b: i32, c: i32, d: i32, e: i32, f: i32, g: i32, h: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `LeftBracket` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | LeftBracket, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `RightBracket` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:44:5 [INFO] [stdout] | [INFO] [stdout] 44 | RightBracket, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `PlusSign` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:45:5 [INFO] [stdout] | [INFO] [stdout] 45 | PlusSign, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `MinusSign` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:46:5 [INFO] [stdout] | [INFO] [stdout] 46 | MinusSign, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variant is never constructed: `Number` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 47 | Number(i64), [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calculate` [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MyStack` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `top` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `empty` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:93:8 [INFO] [stdout] | [INFO] [stdout] 93 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `invert_tree` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0227_basic_calculator_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `calculate` [INFO] [stdout] --> src/solution/s0227_basic_calculator_ii.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `summary_ranges` [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn summary_ranges(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `record` [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn record(vec: &mut Vec, start: i32, end: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0229_majority_element_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `majority_element` [INFO] [stdout] --> src/solution/s0229_majority_element_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn majority_element(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `kth_smallest` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn helper(root: Option>>, k: i32, res: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0231_power_of_two.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_power_of_two` [INFO] [stdout] --> src/solution/s0231_power_of_two.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn is_power_of_two(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MyQueue` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 70 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `peek` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | fn peek(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `empty` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:80:8 [INFO] [stdout] | [INFO] [stdout] 80 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_digit_one` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn count_digit_one(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0238_product_of_array_except_self.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `product_except_self` [INFO] [stdout] --> src/solution/s0238_product_of_array_except_self.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0239_sliding_window_maximum.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_sliding_window` [INFO] [stdout] --> src/solution/s0239_sliding_window_maximum.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn max_sliding_window(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0241_different_ways_to_add_parentheses.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `diff_ways_to_compute` [INFO] [stdout] --> src/solution/s0241_different_ways_to_add_parentheses.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn diff_ways_to_compute(input: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0241_different_ways_to_add_parentheses.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn helper(input: &str) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0242_valid_anagram.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_anagram` [INFO] [stdout] --> src/solution/s0242_valid_anagram.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `hit` [INFO] [stdout] --> src/solution/s0242_valid_anagram.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn hit(s: String) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `binary_tree_paths` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn binary_tree_paths(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | fn helper(root: Option>>, path: String, res: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0258_add_digits.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_digits` [INFO] [stdout] --> src/solution/s0258_add_digits.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn add_digits(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0260_single_number_iii.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `single_number` [INFO] [stdout] --> src/solution/s0260_single_number_iii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn single_number(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0263_ugly_number.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_ugly` [INFO] [stdout] --> src/solution/s0263_ugly_number.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn is_ugly(num: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `nth_ugly_number` [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn nth_ugly_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0268_missing_number.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `missing_number` [INFO] [stdout] --> src/solution/s0268_missing_number.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn missing_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `number_to_words` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn number_to_words(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0274_h_index.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `h_index` [INFO] [stdout] --> src/solution/s0274_h_index.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn h_index(mut citations: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0275_h_index_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `h_index` [INFO] [stdout] --> src/solution/s0275_h_index_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn h_index(citations: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0279_perfect_squares.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_squares` [INFO] [stdout] --> src/solution/s0279_perfect_squares.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_operators` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0283_move_zeroes.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_zeroes` [INFO] [stdout] --> src/solution/s0283_move_zeroes.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0287_find_the_duplicate_number.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_duplicate` [INFO] [stdout] --> src/solution/s0287_find_the_duplicate_number.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn find_duplicate(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0289_game_of_life.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `game_of_life` [INFO] [stdout] --> src/solution/s0289_game_of_life.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn game_of_life(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0290_word_pattern.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `word_pattern` [INFO] [stdout] --> src/solution/s0290_word_pattern.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn word_pattern(pattern: String, s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0292_nim_game.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_win_nim` [INFO] [stdout] --> src/solution/s0292_nim_game.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn can_win_nim(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `MedianFinder` [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | struct MedianFinder { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_num` [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:86:8 [INFO] [stdout] | [INFO] [stdout] 86 | fn add_num(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_median` [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | fn find_median(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0299_bulls_and_cows.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_hint` [INFO] [stdout] --> src/solution/s0299_bulls_and_cows.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn get_hint(secret: String, guess: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0300_longest_increasing_subsequence.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `length_of_lis` [INFO] [stdout] --> src/solution/s0300_longest_increasing_subsequence.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_invalid_parentheses` [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn remove_invalid_parentheses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `helper` [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | fn helper( [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NumArray` [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sum_range` [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | fn sum_range(&self, i: i32, j: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NumMatrix` [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct NumMatrix { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sum_region` [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0306_additive_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_additive_number` [INFO] [stdout] --> src/solution/s0306_additive_number.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn is_additive_number(num: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `second_cut` [INFO] [stdout] --> src/solution/s0306_additive_number.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 60 | fn second_cut(from: usize, len: usize, num1: u32, chs: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `third_cut` [INFO] [stdout] --> src/solution/s0306_additive_number.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | fn third_cut( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `NumArray` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `update` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | fn update(&mut self, i: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sum_range` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:67:8 [INFO] [stdout] | [INFO] [stdout] 67 | fn sum_range(&self, i: i32, j: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `build` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:71:8 [INFO] [stdout] | [INFO] [stdout] 71 | fn build(node: usize, start: usize, end: usize, tree: &mut Vec, nums: &Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `update_internal` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | fn update_internal( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sum` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | fn sum( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_profit` [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0310_minimum_height_trees.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_min_height_trees` [INFO] [stdout] --> src/solution/s0310_minimum_height_trees.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn find_min_height_trees(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0312_burst_balloons.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_coins` [INFO] [stdout] --> src/solution/s0312_burst_balloons.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn max_coins(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_subrange` [INFO] [stdout] --> src/solution/s0312_burst_balloons.rs:68:8 [INFO] [stdout] | [INFO] [stdout] 68 | fn max_subrange(coins: &Vec, start: usize, end: usize, memo: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0313_super_ugly_number.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `nth_super_ugly_number` [INFO] [stdout] --> src/solution/s0313_super_ugly_number.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn nth_super_ugly_number(n: i32, primes: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0509_fibonacci_number.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fib` [INFO] [stdout] --> src/solution/s0509_fibonacci_number.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn fib(n: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0704_binary_search.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/solution/s0704_binary_search.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0969_pancake_sorting.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pancake_sort` [INFO] [stdout] --> src/solution/s0969_pancake_sorting.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn pancake_sort(a: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_k` [INFO] [stdout] --> src/solution/s0969_pancake_sorting.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | fn find_k(a: &Vec, k: i32) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pancake_oper` [INFO] [stdout] --> src/solution/s0969_pancake_sorting.rs:87:12 [INFO] [stdout] | [INFO] [stdout] 87 | pub fn pancake_oper(a: &mut Vec, index: usize, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s1018_binary_prefix_divisible_by_5.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `prefixes_div_by5` [INFO] [stdout] --> src/solution/s1018_binary_prefix_divisible_by_5.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn prefixes_div_by5(a: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `last_stone_weight` [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn last_stone_weight(stones: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 778 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:36:9 [INFO] [stdout] | [INFO] [stdout] 35 | loop {} [INFO] [stdout] | ------- any code following this expression is unreachable [INFO] [stdout] 36 | s[result.0..result.1].to_owned() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable statement [INFO] [stdout] --> src/solution/s0202_happy_number.rs:43:9 [INFO] [stdout] | [INFO] [stdout] 32 | / loop { [INFO] [stdout] 33 | | set.insert(n); [INFO] [stdout] 34 | | let temp = Solution::next(n); [INFO] [stdout] 35 | | if temp == 1 { [INFO] [stdout] ... | [INFO] [stdout] 41 | | n = temp [INFO] [stdout] 42 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 43 | return false; [INFO] [stdout] | ^^^^^^^^^^^^^ unreachable statement [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums1` [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:38:38 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums2` [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:38:55 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `digit` is never read [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let mut digit: i64 = 0; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:79:21 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:79:32 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_p` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `curr_area` is never read [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut curr_area: i32 = 0; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dividend` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:39:19 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dividend` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `divisor` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:39:34 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_divisor` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `substr_len` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:70:13 [INFO] [stdout] | [INFO] [stdout] 70 | let substr_len = word_len * words.len(); [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_substr_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `entry` [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:110:35 [INFO] [stdout] | [INFO] [stdout] 110 | Entry::Vacant(entry) => { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_entry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:32:41 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:46:26 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:46:42 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn solve_sudoku(board: &mut Vec>) {} [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:25:17 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `carry` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut carry = 0_u32; [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_carry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:48:14 [INFO] [stdout] | [INFO] [stdout] 48 | for (i, multiplier) in num1.into_iter().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `multiplier` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:48:17 [INFO] [stdout] | [INFO] [stdout] 48 | for (i, multiplier) in num1.into_iter().enumerate() { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_multiplier` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `multiplicand` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:52:18 [INFO] [stdout] | [INFO] [stdout] 52 | for &multiplicand in num2.iter() {} [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_multiplicand` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:78:21 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:78:32 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_p` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:32:17 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:28:13 [INFO] [stdout] | [INFO] [stdout] 28 | let mut j = 0_usize; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:37:54 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:47:22 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn is_number(s: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:50:13 [INFO] [stdout] | [INFO] [stdout] 50 | for i in 2..n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word1` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_word1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word2` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:40 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_word2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:57:23 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn set_zeroes(matrix: &mut Vec>) {} [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:14 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `end` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_end` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `result` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | let mut result = (0_usize, 0_usize); [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_result` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:55:30 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:39:19 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:39:35 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:46:30 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:46:30 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:28:30 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s1` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:72:24 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:72:36 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:39:26 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:28 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `m` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:57 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_m` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:65 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:22:33 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `val` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:63:13 [INFO] [stdout] | [INFO] [stdout] 63 | for val in 2..n + 1 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_val` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `parent` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:71:21 [INFO] [stdout] | [INFO] [stdout] 71 | let mut parent = dummy.as_ref().unwrap().clone(); [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_parent` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:72:21 [INFO] [stdout] | [INFO] [stdout] 72 | let mut node = root; [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:30:22 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `trans` [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:81:13 [INFO] [stdout] | [INFO] [stdout] 81 | for trans in 0..max_trans { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_trans` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `gas` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:64:33 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_gas` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cost` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:64:48 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_cost` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word_dict` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:59:34 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_word_dict` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn reorder_list(head: &mut Option>) { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:51:32 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut mid = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:43:13 [INFO] [stdout] | [INFO] [stdout] 43 | let mut mid = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `numerator` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:38:32 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_numerator` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `denominator` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:38:48 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_denominator` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:49:28 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn title_to_number(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `words` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:44:46 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_words` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn shortest_palindrome(s: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `buildings` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:33:24 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn get_skyline(buildings: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_buildings` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:23:28 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn count_digit_one(n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:48:28 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn number_to_words(num: i32) -> String { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:48:26 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:48:39 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max` [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | let mut max = 0; [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::env` [INFO] [stdout] --> src/main.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use std::env; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: the item `fs` is imported redundantly [INFO] [stdout] --> src/main.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 11 | use std::fs; [INFO] [stdout] | ------- the item `fs` is already imported here [INFO] [stdout] ... [INFO] [stdout] 152 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs` [INFO] [stdout] --> src/main.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 152 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0015_3sum.rs:48:17 [INFO] [stdout] | [INFO] [stdout] 48 | let mut vec = Solution::two_sum(&nums[(i + 1)..len], 0 - nums[i]); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:42:17 [INFO] [stdout] | [INFO] [stdout] 42 | let mut next = right.as_mut().unwrap().next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | let mut tail = end.as_mut().unwrap().next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | mut head: Option>, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:72:17 [INFO] [stdout] | [INFO] [stdout] 72 | let mut next = current_node_inner.next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::env` [INFO] [stdout] --> src/main.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use std::env; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: the item `fs` is imported redundantly [INFO] [stdout] --> src/main.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 11 | use std::fs; [INFO] [stdout] | ------- the item `fs` is already imported here [INFO] [stdout] ... [INFO] [stdout] 152 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs` [INFO] [stdout] --> src/main.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 152 | use std::fs; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | let mut vec = Vec::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:59:9 [INFO] [stdout] | [INFO] [stdout] 59 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut vec = Vec::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut carry = 0_u32; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0046_permutations.rs:36:21 [INFO] [stdout] | [INFO] [stdout] 36 | let mut sub = nums.clone().into_iter().filter(|&x| x != num).collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:33:16 [INFO] [stdout] | [INFO] [stdout] 33 | fn permute(mut nums: Vec) -> Vec> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:83:13 [INFO] [stdout] | [INFO] [stdout] 83 | let mut matrix = matrix; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:28:13 [INFO] [stdout] | [INFO] [stdout] 28 | let mut j = 0_usize; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:53:13 [INFO] [stdout] | [INFO] [stdout] 53 | let mut k = k; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:55:13 [INFO] [stdout] | [INFO] [stdout] 55 | let mut res = String::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:14 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | let (mut start, mut end) = (0_usize, 0_usize); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:34:13 [INFO] [stdout] | [INFO] [stdout] 34 | let mut result = (0_usize, 0_usize); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | let mut max_area = 0; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0086_partition_list.rs:32:17 [INFO] [stdout] | [INFO] [stdout] 32 | let mut next = inner.next.take(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut next = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:66:21 [INFO] [stdout] | [INFO] [stdout] 66 | let mut dummy = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:71:21 [INFO] [stdout] | [INFO] [stdout] 71 | let mut parent = dummy.as_ref().unwrap().clone(); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:72:21 [INFO] [stdout] | [INFO] [stdout] 72 | let mut node = root; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `futures::stream::StreamExt` [INFO] [stdout] --> src/main.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use futures::stream::StreamExt; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `is_random` is assigned to, but never used [INFO] [stdout] --> src/main.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | let mut is_random = false; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] = note: consider using `_is_random` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `is_solving` is assigned to, but never used [INFO] [stdout] --> src/main.rs:36:13 [INFO] [stdout] | [INFO] [stdout] 36 | let mut is_solving = false; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_is_solving` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `id` is never read [INFO] [stdout] --> src/main.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut id: u32 = 0; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `is_random` is never read [INFO] [stdout] --> src/main.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | is_random = true; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `is_solving` is never read [INFO] [stdout] --> src/main.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | is_solving = true; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/main.rs:72:17 [INFO] [stdout] | [INFO] [stdout] 72 | let mut mod_file_addon = Arc::new(Mutex::new(vec![])); [INFO] [stdout] | ----^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | let mut right = node.borrow().right.clone(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:113:29 [INFO] [stdout] | [INFO] [stdout] 113 | let mut prev = &mut paths[j].1; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `futures::stream::StreamExt` [INFO] [stdout] --> src/main.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | use futures::stream::StreamExt; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `is_random` is assigned to, but never used [INFO] [stdout] --> src/main.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | let mut is_random = false; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] = note: consider using `_is_random` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `is_solving` is assigned to, but never used [INFO] [stdout] --> src/main.rs:36:13 [INFO] [stdout] | [INFO] [stdout] 36 | let mut is_solving = false; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_is_solving` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `id` is never read [INFO] [stdout] --> src/main.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut id: u32 = 0; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `is_random` is never read [INFO] [stdout] --> src/main.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | is_random = true; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `is_solving` is never read [INFO] [stdout] --> src/main.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | is_solving = true; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:44:22 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn sort_list(mut head: Option>) -> Option> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:64:13 [INFO] [stdout] | [INFO] [stdout] 64 | let mut l2 = next.unwrap().next.take(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:65:13 [INFO] [stdout] | [INFO] [stdout] 65 | let mut l1 = Solution::merge_sort(head, len / 2); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | let mut l2 = Solution::merge_sort(l2, len - len / 2); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:92:23 [INFO] [stdout] | [INFO] [stdout] 92 | (Some(mut node1), None) => { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0148_sort_list.rs:96:29 [INFO] [stdout] | [INFO] [stdout] 96 | (None, Some(mut node2)) => { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/main.rs:72:17 [INFO] [stdout] | [INFO] [stdout] 72 | let mut mod_file_addon = Arc::new(Mutex::new(vec![])); [INFO] [stdout] | ----^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:100:13 [INFO] [stdout] | [INFO] [stdout] 100 | let mut set: HashSet = HashSet::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:55:26 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn reverse_words(mut s: String) -> String { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:116:13 [INFO] [stdout] | [INFO] [stdout] 116 | writeln!(lib_file, "{}", mod_file_addon.lock().unwrap().join("\n")); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:311:5 [INFO] [stdout] | [INFO] [stdout] 311 | fs::write(mod_file, lines.join("\n")); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:317:5 [INFO] [stdout] | [INFO] [stdout] 317 | writeln!(lib_file, "mod {};", solution_name); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:360:9 [INFO] [stdout] | [INFO] [stdout] 360 | writeln!(lib_file, "mod {};", file_name); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0198_house_robber.rs:48:17 [INFO] [stdout] | [INFO] [stdout] 48 | let mut temp = curr_max; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let mut seed = Vec::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:52:54 [INFO] [stdout] | [INFO] [stdout] 52 | fn helper(distance: i32, prev: i32, remain: i32, mut curr: Vec, res: &mut Vec>) { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:116:13 [INFO] [stdout] | [INFO] [stdout] 116 | writeln!(lib_file, "{}", mod_file_addon.lock().unwrap().join("\n")); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:311:5 [INFO] [stdout] | [INFO] [stdout] 311 | fs::write(mod_file, lines.join("\n")); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:317:5 [INFO] [stdout] | [INFO] [stdout] 317 | writeln!(lib_file, "mod {};", solution_name); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/main.rs:360:9 [INFO] [stdout] | [INFO] [stdout] 360 | writeln!(lib_file, "mod {};", file_name); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:42:13 [INFO] [stdout] | [INFO] [stdout] 42 | let mut chs: Vec = s.chars().collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:69:13 [INFO] [stdout] | [INFO] [stdout] 69 | let mut nums = NumArray::new(vec![-2, 0, 3, -5, 2, -1]); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0306_additive_number.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | let mut chs: Vec = num.chars().map(|c| c.to_digit(10).unwrap()).collect(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | let mut max = 0; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary `unsafe` block [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:99:34 [INFO] [stdout] | [INFO] [stdout] 99 | (Some(ptr), Some(unsafe { (*entry).val })) [INFO] [stdout] | ^^^^^^ unnecessary `unsafe` block [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_unsafe)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:79:12 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `divide` [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_range` [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search_insert` [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `solve_sudoku` [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn solve_sudoku(board: &mut Vec>) {} [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `trap` [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `multiply` [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn multiply(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_match` [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:78:12 [INFO] [stdout] | [INFO] [stdout] 78 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `jump` [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `permute_unique` [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn permute_unique(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_permutation` [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn get_permutation(n: i32, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rotate_right` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_number` [INFO] [stdout] --> src/solution/s0065_valid_number.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn is_number(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_distance` [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set_zeroes` [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn set_zeroes(matrix: &mut Vec>) {} [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `min_window` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_char` [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | fn count_char(s: String) -> HashMap { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `remove_duplicates` [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `search` [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_duplicates` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete_duplicates` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `maximal_rectangle` [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_scramble` [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_decodings` [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reverse_between` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn reverse_between(head: Option>, m: i32, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `restore_ip_addresses` [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `generate_trees` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn generate_trees(n: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `num_trees` [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `can_complete_circuit` [INFO] [stdout] --> src/solution/s0134_gas_station.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `word_break` [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `reorder_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn reorder_list(head: &mut Option>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insertion_sort_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0155_min_stack.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `fraction_to_decimal` [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `title_to_number` [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn title_to_number(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WordDictionary` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `is_end` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:42:5 [INFO] [stdout] | [INFO] [stdout] 42 | is_end: bool, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `marked` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | marked: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `nodes` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:44:5 [INFO] [stdout] | [INFO] [stdout] 44 | nodes: [Option>; 26], [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/solution/s0211_add_and_search_word_data_structure_design.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find_words` [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `shortest_palindrome` [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn shortest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get_skyline` [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn get_skyline(buildings: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `count_digit_one` [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn count_digit_one(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `number_to_words` [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn number_to_words(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_operators` [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 271 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 2m 04s [INFO] running `Command { std: "docker" "inspect" "1501f2fc3a4925bd401695675d30b087d775f30f7b4f0e12fe6b43977b6b498b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "1501f2fc3a4925bd401695675d30b087d775f30f7b4f0e12fe6b43977b6b498b", kill_on_drop: false }` [INFO] [stdout] 1501f2fc3a4925bd401695675d30b087d775f30f7b4f0e12fe6b43977b6b498b