[INFO] cloning repository https://github.com/tan-wei/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/tan-wei/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 546396a965eef04f9da9e437e711b22e34fecc2b [INFO] checking tan-wei/leetcode-rust against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/tan-wei/leetcode-rust on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-3-tc1/source/.cargo/config.toml [INFO] started tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] finished tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] tweaked toml for git repo https://github.com/tan-wei/leetcode-rust written to /workspace/builds/worker-3-tc1/source/Cargo.toml [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 305 packages to latest compatible versions [INFO] [stderr] Adding addr2line v0.22.0 (latest: v0.24.1) [INFO] [stderr] Adding aead v0.3.2 (latest: v0.5.2) [INFO] [stderr] Adding aes v0.6.0 (latest: v0.8.4) [INFO] [stderr] Adding aes-gcm v0.8.0 (latest: v0.10.3) [INFO] [stderr] Adding aes-soft v0.6.4 (latest: v0.99.99) [INFO] [stderr] Adding aesni v0.10.0 (latest: v0.99.99) [INFO] [stderr] Adding async-channel v1.9.0 (latest: v2.3.1) [INFO] [stderr] Adding async-io v1.13.0 (latest: v2.3.4) [INFO] [stderr] Adding async-lock v2.8.0 (latest: v3.4.0) [INFO] [stderr] Adding autocfg v0.1.8 (latest: v1.3.0) [INFO] [stderr] Adding base64 v0.13.1 (latest: v0.22.1) [INFO] [stderr] Adding bitflags v1.3.2 (latest: v2.6.0) [INFO] [stderr] Adding block-buffer v0.9.0 (latest: v0.10.4) [INFO] [stderr] Adding bytes v0.5.6 (latest: v1.7.1) [INFO] [stderr] Adding cipher v0.2.5 (latest: v0.4.4) [INFO] [stderr] Adding cloudabi v0.0.3 (latest: v0.1.0) [INFO] [stderr] Adding cookie v0.14.4 (latest: v0.18.1) [INFO] [stderr] Adding core-foundation v0.9.4 (latest: v0.10.0) [INFO] [stderr] Adding cpuid-bool v0.2.0 (latest: v0.99.99) [INFO] [stderr] Adding crypto-mac v0.10.0 (latest: v0.11.1) [INFO] [stderr] Adding ctr v0.6.0 (latest: v0.9.2) [INFO] [stderr] Adding digest v0.9.0 (latest: v0.10.7) [INFO] [stderr] Adding event-listener v2.5.3 (latest: v5.3.1) [INFO] [stderr] Adding fastrand v1.9.0 (latest: v2.1.1) [INFO] [stderr] Adding flume v0.9.2 (latest: v0.11.0) [INFO] [stderr] Adding foreign-types v0.3.2 (latest: v0.5.0) [INFO] [stderr] Adding foreign-types-shared v0.1.1 (latest: v0.3.1) [INFO] [stderr] Adding futures-lite v1.13.0 (latest: v2.3.0) [INFO] [stderr] Adding generic-array v0.14.7 (latest: v1.1.0) [INFO] [stderr] Adding getrandom v0.1.16 (latest: v0.2.15) [INFO] [stderr] Adding ghash v0.3.1 (latest: v0.5.1) [INFO] [stderr] Adding gimli v0.29.0 (latest: v0.31.0) [INFO] [stderr] Adding gloo-timers v0.2.6 (latest: v0.3.0) [INFO] [stderr] Adding hermit-abi v0.3.9 (latest: v0.4.0) [INFO] [stderr] Adding hkdf v0.10.0 (latest: v0.12.4) [INFO] [stderr] Adding hmac v0.10.1 (latest: v0.12.1) [INFO] [stderr] Adding http v0.2.12 (latest: v1.1.0) [INFO] [stderr] Adding idna v0.5.0 (latest: v1.0.2) [INFO] [stderr] Adding infer v0.2.3 (latest: v0.16.0) [INFO] [stderr] Adding io-lifetimes v1.0.11 (latest: v2.0.3) [INFO] [stderr] Adding isahc v0.9.14 (latest: v1.7.2) [INFO] [stderr] Adding linux-raw-sys v0.3.8 (latest: v0.6.5) [INFO] [stderr] Adding linux-raw-sys v0.4.14 (latest: v0.6.5) [INFO] [stderr] Adding miniz_oxide v0.7.4 (latest: v0.8.0) [INFO] [stderr] Adding polling v2.8.0 (latest: v3.7.3) [INFO] [stderr] Adding polyval v0.4.5 (latest: v0.6.2) [INFO] [stderr] Adding rand v0.6.5 (latest: v0.8.5) [INFO] [stderr] Adding rand v0.7.3 (latest: v0.8.5) [INFO] [stderr] Adding rand_chacha v0.1.1 (latest: v0.3.1) [INFO] [stderr] Adding rand_chacha v0.2.2 (latest: v0.3.1) [INFO] [stderr] Adding rand_core v0.3.1 (latest: v0.6.4) [INFO] [stderr] Adding rand_core v0.4.2 (latest: v0.6.4) [INFO] [stderr] Adding rand_core v0.5.1 (latest: v0.6.4) [INFO] [stderr] Adding rand_hc v0.1.0 (latest: v0.3.2) [INFO] [stderr] Adding rand_hc v0.2.0 (latest: v0.3.2) [INFO] [stderr] Adding rand_isaac v0.1.1 (latest: v0.3.0) [INFO] [stderr] Adding rand_jitter v0.1.4 (latest: v0.4.0) [INFO] [stderr] Adding rand_os v0.1.3 (latest: v0.2.2) [INFO] [stderr] Adding rand_pcg v0.1.2 (latest: v0.3.1) [INFO] [stderr] Adding rand_xorshift v0.1.1 (latest: v0.3.0) [INFO] [stderr] Adding rdrand v0.4.0 (latest: v0.8.3) [INFO] [stderr] Adding rustc_version v0.2.3 (latest: v0.4.1) [INFO] [stderr] Adding rustix v0.37.27 (latest: v0.38.35) [INFO] [stderr] Adding semver v0.9.0 (latest: v1.0.23) [INFO] [stderr] Adding semver-parser v0.7.0 (latest: v0.10.2) [INFO] [stderr] Adding serde_qs v0.8.5 (latest: v0.13.0) [INFO] [stderr] Adding sha1 v0.6.1 (latest: v0.10.6) [INFO] [stderr] Adding sha2 v0.9.9 (latest: v0.10.8) [INFO] [stderr] Adding socket2 v0.4.10 (latest: v0.5.7) [INFO] [stderr] Adding spinning_top v0.2.5 (latest: v0.3.0) [INFO] [stderr] Adding standback v0.2.17 (latest: v0.4.4) [INFO] [stderr] Adding syn v1.0.109 (latest: v2.0.77) [INFO] [stderr] Adding time v0.2.27 (latest: v0.3.36) [INFO] [stderr] Adding time-macros v0.1.1 (latest: v0.2.18) [INFO] [stderr] Adding tower v0.4.13 (latest: v0.5.0) [INFO] [stderr] Adding universal-hash v0.4.0 (latest: v0.5.1) [INFO] [stderr] Adding wasi v0.9.0+wasi-snapshot-preview1 (latest: v0.13.2+wasi-0.2.1) [INFO] [stderr] Adding wasi v0.11.0+wasi-snapshot-preview1 (latest: v0.13.2+wasi-0.2.1) [INFO] [stderr] Adding windows-sys v0.48.0 (latest: v0.59.0) [INFO] [stderr] Adding windows-sys v0.52.0 (latest: v0.59.0) [INFO] [stderr] Adding windows-targets v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_aarch64_gnullvm v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_aarch64_msvc v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_i686_gnu v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_i686_msvc v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_gnu v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_gnullvm v0.48.5 (latest: v0.52.6) [INFO] [stderr] Adding windows_x86_64_msvc v0.48.5 (latest: v0.52.6) [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded const_fn v0.4.10 [INFO] [stderr] Downloaded crypto-mac v0.10.0 [INFO] [stderr] Downloaded spinning_top v0.2.5 [INFO] [stderr] Downloaded curl v0.4.46 [INFO] [stderr] Downloaded universal-hash v0.4.0 [INFO] [stderr] Downloaded assert_float_eq v1.1.3 [INFO] [stderr] Downloaded libz-sys v1.1.20 [INFO] [stderr] Downloaded libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Downloaded curl-sys v0.4.74+curl-8.9.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/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" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] c28e966796854c1e143b741cf10bd73e19d59ed033edda2d39d302b6c36ac734 [INFO] running `Command { std: "docker" "start" "-a" "c28e966796854c1e143b741cf10bd73e19d59ed033edda2d39d302b6c36ac734", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "c28e966796854c1e143b741cf10bd73e19d59ed033edda2d39d302b6c36ac734", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c28e966796854c1e143b741cf10bd73e19d59ed033edda2d39d302b6c36ac734", kill_on_drop: false }` [INFO] [stdout] c28e966796854c1e143b741cf10bd73e19d59ed033edda2d39d302b6c36ac734 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/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" "RUSTDOCFLAGS=--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" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] e51627f6849148e6acf4200453dc362e6bcccb4197eac508e2b5b792138532fc [INFO] running `Command { std: "docker" "start" "-a" "e51627f6849148e6acf4200453dc362e6bcccb4197eac508e2b5b792138532fc", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.158 [INFO] [stderr] Compiling proc-macro2 v1.0.86 [INFO] [stderr] Compiling version_check v0.9.5 [INFO] [stderr] Compiling shlex v1.3.0 [INFO] [stderr] Checking value-bag v1.9.0 [INFO] [stderr] Checking memchr v2.7.4 [INFO] [stderr] Compiling crossbeam-utils v0.8.20 [INFO] [stderr] Checking bytes v1.7.1 [INFO] [stderr] Checking parking v2.2.0 [INFO] [stderr] Checking bitflags v2.6.0 [INFO] [stderr] Checking subtle v2.6.1 [INFO] [stderr] Compiling serde v1.0.209 [INFO] [stderr] Checking fastrand v2.1.1 [INFO] [stderr] Checking opaque-debug v0.3.1 [INFO] [stderr] Checking byteorder v1.5.0 [INFO] [stderr] Compiling autocfg v0.1.8 [INFO] [stderr] Compiling proc-macro-hack v0.5.20+deprecated [INFO] [stderr] Compiling rustix v0.38.35 [INFO] [stderr] Compiling syn v1.0.109 [INFO] [stderr] Compiling wasm-bindgen-shared v0.2.93 [INFO] [stderr] Checking tinyvec v1.8.0 [INFO] [stderr] Checking linux-raw-sys v0.4.14 [INFO] [stderr] Checking futures-lite v2.3.0 [INFO] [stderr] Checking log v0.4.22 [INFO] [stderr] Compiling io-lifetimes v1.0.11 [INFO] [stderr] Compiling generic-array v0.14.7 [INFO] [stderr] Compiling standback v0.2.17 [INFO] [stderr] Checking http v1.1.0 [INFO] [stderr] Compiling unicase v2.7.0 [INFO] [stderr] Compiling polling v2.8.0 [INFO] [stderr] Checking cpuid-bool v0.2.0 [INFO] [stderr] Checking concurrent-queue v2.5.0 [INFO] [stderr] Compiling bumpalo v3.16.0 [INFO] [stderr] Checking unicode-bidi v0.3.15 [INFO] [stderr] Checking waker-fn v1.2.0 [INFO] [stderr] Compiling rustix v0.37.27 [INFO] [stderr] Checking fastrand v1.9.0 [INFO] [stderr] Compiling const_fn v0.4.10 [INFO] [stderr] Compiling quote v1.0.37 [INFO] [stderr] Checking event-listener v5.3.1 [INFO] [stderr] Checking async-task v4.7.1 [INFO] [stderr] Checking cipher v0.2.5 [INFO] [stderr] Checking digest v0.9.0 [INFO] [stderr] Checking universal-hash v0.4.0 [INFO] [stderr] Checking crypto-mac v0.10.0 [INFO] [stderr] Checking unicode-normalization v0.1.23 [INFO] [stderr] Checking aes-soft v0.6.4 [INFO] [stderr] Checking polyval v0.4.5 [INFO] [stderr] Compiling syn v2.0.77 [INFO] [stderr] Checking event-listener-strategy v0.5.2 [INFO] [stderr] Checking futures-lite v1.13.0 [INFO] [stderr] Checking async-channel v1.9.0 [INFO] [stderr] Compiling time v0.2.27 [INFO] [stderr] Checking piper v0.2.4 [INFO] [stderr] Checking async-channel v2.3.1 [INFO] [stderr] Checking async-lock v3.4.0 [INFO] [stderr] Compiling async-io v1.13.0 [INFO] [stderr] Compiling serde_json v1.0.127 [INFO] [stderr] Checking linux-raw-sys v0.3.8 [INFO] [stderr] Compiling openssl v0.10.66 [INFO] [stderr] Compiling httparse v1.9.4 [INFO] [stderr] Checking hashbrown v0.14.5 [INFO] [stderr] Compiling thiserror v1.0.63 [INFO] [stderr] Checking blocking v1.6.1 [INFO] [stderr] Checking http-body v1.0.1 [INFO] [stderr] Checking aes v0.6.0 [INFO] [stderr] Checking ghash v0.3.1 [INFO] [stderr] Checking hmac v0.10.1 [INFO] [stderr] Checking async-executor v1.13.0 [INFO] [stderr] Checking ctr v0.6.0 [INFO] [stderr] Checking idna v0.5.0 [INFO] [stderr] Checking block-buffer v0.9.0 [INFO] [stderr] Checking aead v0.3.2 [INFO] [stderr] Compiling cookie v0.14.4 [INFO] [stderr] Checking async-lock v2.8.0 [INFO] [stderr] Compiling curl v0.4.46 [INFO] [stderr] Compiling zstd-safe v7.2.1 [INFO] [stderr] Checking cpufeatures v0.2.13 [INFO] [stderr] Checking alloc-no-stdlib v2.0.4 [INFO] [stderr] Compiling wasm-bindgen v0.2.93 [INFO] [stderr] Compiling native-tls v0.2.12 [INFO] [stderr] Checking alloc-stdlib v0.2.2 [INFO] [stderr] Checking sha2 v0.9.9 [INFO] [stderr] Checking aes-gcm v0.8.0 [INFO] [stderr] Checking hkdf v0.10.0 [INFO] [stderr] Checking socket2 v0.5.7 [INFO] [stderr] Checking parking_lot_core v0.9.10 [INFO] [stderr] Checking signal-hook-registry v1.4.2 [INFO] [stderr] Checking mio v1.0.2 [INFO] [stderr] Checking getrandom v0.2.15 [INFO] [stderr] Compiling jobserver v0.1.32 [INFO] [stderr] Checking getrandom v0.1.16 [INFO] [stderr] Checking indexmap v2.5.0 [INFO] [stderr] Checking rand_core v0.6.4 [INFO] [stderr] Checking socket2 v0.4.10 [INFO] [stderr] Checking parking_lot v0.12.3 [INFO] [stderr] Checking rand_core v0.5.1 [INFO] [stderr] Checking kv-log-macro v1.0.7 [INFO] [stderr] Checking spinning_top v0.2.5 [INFO] [stderr] Compiling http-types v2.12.0 [INFO] [stderr] Checking adler2 v2.0.0 [INFO] [stderr] Compiling cc v1.1.15 [INFO] [stderr] Checking tower-layer v0.3.3 [INFO] [stderr] Compiling isahc v0.9.14 [INFO] [stderr] Checking tower-service v0.3.3 [INFO] [stderr] Checking flume v0.9.2 [INFO] [stderr] Checking miniz_oxide v0.8.0 [INFO] [stderr] Compiling mime_guess v2.0.5 [INFO] [stderr] Checking brotli-decompressor v4.0.1 [INFO] [stderr] Checking sluice v0.5.5 [INFO] [stderr] Checking http v0.2.12 [INFO] [stderr] Compiling rand_chacha v0.1.1 [INFO] [stderr] Compiling rand_pcg v0.1.2 [INFO] [stderr] Checking crc32fast v1.4.2 [INFO] [stderr] Checking bytes v0.5.6 [INFO] [stderr] Checking infer v0.2.3 [INFO] [stderr] Checking num_cpus v1.16.0 [INFO] [stderr] Checking aho-corasick v1.1.3 [INFO] [stderr] Compiling rand v0.6.5 [INFO] [stderr] Checking encoding_rs v0.8.34 [INFO] [stderr] Checking rustls-pki-types v1.8.0 [INFO] [stderr] Checking regex-syntax v0.8.4 [INFO] [stderr] Checking flate2 v1.0.33 [INFO] [stderr] Checking rand_os v0.1.3 [INFO] [stderr] Checking ipnet v2.9.0 [INFO] [stderr] Checking rustls-pemfile v2.1.3 [INFO] [stderr] Checking dotenv v0.15.0 [INFO] [stderr] Checking assert_float_eq v1.1.3 [INFO] [stderr] Checking brotli v6.0.0 [INFO] [stderr] Compiling openssl-sys v0.9.103 [INFO] [stderr] Compiling libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Compiling libz-sys v1.1.20 [INFO] [stderr] Compiling curl-sys v0.4.74+curl-8.9.0 [INFO] [stderr] Compiling zstd-sys v2.0.13+zstd.1.5.6 [INFO] [stderr] Checking regex-automata v0.4.7 [INFO] [stderr] Compiling time-macros-impl v0.1.2 [INFO] [stderr] Checking time-macros v0.1.1 [INFO] [stderr] Compiling wasm-bindgen-backend v0.2.93 [INFO] [stderr] Compiling tracing-attributes v0.1.27 [INFO] [stderr] Compiling futures-macro v0.3.30 [INFO] [stderr] Compiling zerocopy-derive v0.7.35 [INFO] [stderr] Compiling tokio-macros v2.4.0 [INFO] [stderr] Compiling serde_derive v1.0.209 [INFO] [stderr] Compiling pin-project-internal v1.1.5 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling thiserror-impl v1.0.63 [INFO] [stderr] Compiling async-trait v0.1.81 [INFO] [stderr] Checking regex v1.10.6 [INFO] [stderr] Checking tokio v1.40.0 [INFO] [stderr] Compiling wasm-bindgen-macro-support v0.2.93 [INFO] [stderr] Checking futures-util v0.3.30 [INFO] [stderr] Checking zerocopy v0.7.35 [INFO] [stderr] Checking pin-project v1.1.5 [INFO] [stderr] Checking tracing v0.1.40 [INFO] [stderr] Compiling wasm-bindgen-macro v0.2.93 [INFO] [stderr] Checking polling v3.7.3 [INFO] [stderr] Checking tracing-futures v0.2.5 [INFO] [stderr] Checking ppv-lite86 v0.2.20 [INFO] [stderr] Checking async-io v2.3.4 [INFO] [stderr] Checking zstd v0.13.2 [INFO] [stderr] Checking rand_chacha v0.3.1 [INFO] [stderr] Checking rand_chacha v0.2.2 [INFO] [stderr] Checking rand v0.7.3 [INFO] [stderr] Checking rand v0.8.5 [INFO] [stderr] Checking js-sys v0.3.70 [INFO] [stderr] Checking async-global-executor v2.4.1 [INFO] [stderr] Checking async-std v1.12.0 [INFO] [stderr] Checking http-body-util v0.1.2 [INFO] [stderr] Checking futures-executor v0.3.30 [INFO] [stderr] Checking futures v0.3.30 [INFO] [stderr] Checking tokio-util v0.7.11 [INFO] [stderr] Checking tower v0.4.13 [INFO] [stderr] Checking tokio-native-tls v0.3.1 [INFO] [stderr] Checking async-compression v0.4.12 [INFO] [stderr] Checking h2 v0.4.6 [INFO] [stderr] Checking url v2.5.2 [INFO] [stderr] Checking serde_urlencoded v0.7.1 [INFO] [stderr] Checking serde_qs v0.8.5 [INFO] [stderr] Checking web-sys v0.3.70 [INFO] [stderr] Checking http-client v6.5.3 [INFO] [stderr] Checking surf v2.3.2 [INFO] [stderr] Checking hyper v1.4.1 [INFO] [stderr] Checking hyper-util v0.1.7 [INFO] [stderr] Checking hyper-tls v0.6.0 [INFO] [stderr] Checking reqwest v0.12.7 [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:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | 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:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | 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:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | 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: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/s0024_swap_nodes_in_pairs.rs:31:32 [INFO] [stdout] | [INFO] [stdout] 31 | 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:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:73:20 [INFO] [stdout] | [INFO] [stdout] 73 | if (board[i][j] != '.') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (board[i][j] != '.') { [INFO] [stdout] 73 + if board[i][j] != '.' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:77:24 [INFO] [stdout] | [INFO] [stdout] 77 | if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 77 - if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] 77 + if used1[i][num] || used2[j][num] || used3[k][num] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:47:27 [INFO] [stdout] | [INFO] [stdout] 47 | } else if (j == n - 1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - } else if (j == n - 1) { [INFO] [stdout] 47 + } else if j == n - 1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:42:16 [INFO] [stdout] | [INFO] [stdout] 42 | if (nums[mid] == target) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 42 - if (nums[mid] == target) { [INFO] [stdout] 42 + if nums[mid] == target { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | } else if (nums[mid] > nums[h]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - } else if (nums[mid] > nums[h]) { [INFO] [stdout] 44 + } else if nums[mid] > nums[h] { [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:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | 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:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | 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:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | 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: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: `to_tree` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:44:25 [INFO] [stdout] | [INFO] [stdout] 44 | 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: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/s0098_validate_binary_search_tree.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | 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: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/s0100_same_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | 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: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/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: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/s0105_construct_binary_tree_from_preorder_and_inorder_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/s0106_construct_binary_tree_from_inorder_and_postorder_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/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: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_list` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | 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:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | 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: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/s0111_minimum_depth_of_binary_tree.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/s0112_path_sum.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | 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:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | 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:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..prices.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..prices.len()) { [INFO] [stdout] 53 + for i in 0..prices.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.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/s0129_sum_root_to_leaf_numbers.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:50:20 [INFO] [stdout] | [INFO] [stdout] 50 | if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] 50 + if s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1]) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | 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:42:25 [INFO] [stdout] | [INFO] [stdout] 42 | 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: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_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | 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:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | 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/s0173_binary_search_tree_iterator.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/s0199_binary_tree_right_side_view.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_list` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | 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/s0206_reverse_linked_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | 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/s0222_count_complete_tree_nodes.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.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/s0230_kth_smallest_element_in_a_bst.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_list` [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | 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/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | 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: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:39:15 [INFO] [stdout] | [INFO] [stdout] 39 | while (ugly_numbers.len() < n as usize) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 39 - while (ugly_numbers.len() < n as usize) { [INFO] [stdout] 39 + while ugly_numbers.len() < n as usize { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:47:16 [INFO] [stdout] | [INFO] [stdout] 47 | if (last == ugly_numbers[x] * 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - if (last == ugly_numbers[x] * 2) { [INFO] [stdout] 47 + if last == ugly_numbers[x] * 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:50:16 [INFO] [stdout] | [INFO] [stdout] 50 | if (last == ugly_numbers[y] * 3) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (last == ugly_numbers[y] * 3) { [INFO] [stdout] 50 + if last == ugly_numbers[y] * 3 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | if (last == ugly_numbers[z] * 5) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (last == ugly_numbers[z] * 5) { [INFO] [stdout] 53 + if last == ugly_numbers[z] * 5 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.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: `TryFrom` [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:44:28 [INFO] [stdout] | [INFO] [stdout] 44 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0328_odd_even_linked_list.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: `to_tree` [INFO] [stdout] --> src/solution/s0337_house_robber_iii.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | if (size == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (size == 0) { [INFO] [stdout] 50 + if size == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | 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/s0404_sum_of_left_leaves.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 `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:38:28 [INFO] [stdout] | [INFO] [stdout] 38 | answer.push(if (i % 15 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - answer.push(if (i % 15 == 0) { [INFO] [stdout] 38 + answer.push(if i % 15 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i % 3 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i % 3 == 0) { [INFO] [stdout] 41 + if i % 3 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | if (i % 5 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - if (i % 5 == 0) { [INFO] [stdout] 44 + if i % 5 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0437_path_sum_iii.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_list` [INFO] [stdout] --> src/solution/s0445_add_two_numbers_ii.rs:34:32 [INFO] [stdout] | [INFO] [stdout] 34 | 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/s0449_serialize_and_deserialize_bst.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/s0450_delete_node_in_a_bst.rs:45:25 [INFO] [stdout] | [INFO] [stdout] 45 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s0475_heaters.rs:52:47 [INFO] [stdout] | [INFO] [stdout] 52 | _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] 52 + _ => (heaters[i] - h).min(h - heaters[i - 1]), [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0498_diagonal_traverse.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] 35 + if mat.len() == 0 || mat[0].len() == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0501_find_mode_in_binary_search_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/s0508_most_frequent_subtree_sum.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/s0513_find_bottom_left_tree_value.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0514_freedom_trail.rs:53:26 [INFO] [stdout] | [INFO] [stdout] 53 | for r_pos in (0..ring.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for r_pos in (0..ring.len()) { [INFO] [stdout] 53 + for r_pos in 0..ring.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0515_find_largest_value_in_each_tree_row.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_tree` [INFO] [stdout] --> src/solution/s0530_minimum_absolute_difference_in_bst.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/s0538_convert_bst_to_greater_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0543_diameter_of_binary_tree.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/s0563_binary_tree_tilt.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/s0572_subtree_of_another_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | 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/s0600_non_negative_integers_without_consecutive_ones.rs:61:54 [INFO] [stdout] | [INFO] [stdout] 61 | FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] 61 + FB[bt - 1] + Self::find_integers(n & !(1 << bt)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0606_construct_string_from_binary_tree.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/s0617_merge_two_binary_trees.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/s0623_add_one_row_to_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0637_average_of_levels_in_binary_tree.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/s0652_find_duplicate_subtrees.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0653_two_sum_iv_input_is_a_bst.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/s0654_maximum_binary_tree.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/s0655_print_binary_tree.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/s0662_maximum_width_of_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0665_non_decreasing_array.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] 41 + if i < 2 || nums[i - 2] <= nums[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0669_trim_a_binary_search_tree.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/s0671_second_minimum_node_in_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:61:33 [INFO] [stdout] | [INFO] [stdout] 61 | Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] 61 + Some(root) => match (root.borrow().left.clone(), root.borrow().right.clone()) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:69:24 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_val == root.borrow().val) { [INFO] [stdout] 69 + if left_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:73:24 [INFO] [stdout] | [INFO] [stdout] 73 | if (right_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (right_val == root.borrow().val) { [INFO] [stdout] 73 + if right_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0687_longest_univalue_path.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/s0700_search_in_a_binary_search_tree.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/s0701_insert_into_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:70:20 [INFO] [stdout] | [INFO] [stdout] 70 | if (val < node.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 70 - if (val < node.borrow().val) { [INFO] [stdout] 70 + if val < node.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | if (val <= curr_kth) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - if (val <= curr_kth) { [INFO] [stdout] 71 + if val <= curr_kth { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0725_split_linked_list_in_parts.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0740_delete_and_earn.rs:48:50 [INFO] [stdout] | [INFO] [stdout] 48 | (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 48 - (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] 48 + (2..10001).for_each(|i| dp[i] = i32::max(sum[i] + dp[i - 2], dp[i - 1])); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:51:40 [INFO] [stdout] | [INFO] [stdout] 51 | tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] 51 + tx -= std::cmp::max(1, (tx - sx) / ty) * ty; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:53:40 [INFO] [stdout] | [INFO] [stdout] 53 | ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] 53 + ty -= std::cmp::max(1, (ty - sy) / tx) * tx; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0783_minimum_distance_between_bst_nodes.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/s0814_binary_tree_pruning.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_list` [INFO] [stdout] --> src/solution/s0817_linked_list_components.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | 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/s0830_positions_of_large_groups.rs:49:18 [INFO] [stdout] | [INFO] [stdout] 49 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 49 - for i in (1..n) { [INFO] [stdout] 49 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0863_all_nodes_distance_k_in_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:113:33 [INFO] [stdout] | [INFO] [stdout] 113 | keys |= (1 << (c - b'a')); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 113 - keys |= (1 << (c - b'a')); [INFO] [stdout] 113 + keys |= 1 << (c - b'a'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0865_smallest_subtree_with_all_the_deepest_nodes.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/s0872_leaf_similar_trees.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_list` [INFO] [stdout] --> src/solution/s0876_middle_of_the_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0878_nth_magical_number.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] 41 + let mut hi = n * std::cmp::min(a, b); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0894_all_possible_full_binary_trees.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/s0897_increasing_order_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_tree` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0938_range_sum_of_bst.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/s0951_flip_equivalent_binary_trees.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0958_check_completeness_of_a_binary_tree.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/s0965_univalued_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/s0968_binary_tree_cameras.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/s0971_flip_binary_tree_to_match_preorder_traversal.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | if (arr[i] < arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 57 - if (arr[i] < arr[i - 1]) { [INFO] [stdout] 57 + if arr[i] < arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 60 - } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] 60 + } else if arr[i] > arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0979_distribute_coins_in_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0987_vertical_order_traversal_of_a_binary_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/s0988_smallest_string_starting_from_leaf.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0993_cousins_in_binary_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0995_minimum_number_of_k_consecutive_bit_flips.rs:51:16 [INFO] [stdout] | [INFO] [stdout] 51 | if (i >= k) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (i >= k) { [INFO] [stdout] 51 + if i >= k { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0998_maximum_binary_tree_ii.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/s1008_construct_binary_search_tree_from_preorder_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_list` [INFO] [stdout] --> src/solution/s1019_next_greater_node_in_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | 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/s1022_sum_of_root_to_leaf_binary_numbers.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1026_maximum_difference_between_node_and_ancestor.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1028_recover_a_tree_from_preorder_traversal.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1038_binary_search_tree_to_greater_sum_tree.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/s1080_insufficient_nodes_in_root_to_leaf_paths.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1105_filling_bookcase_shelves.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | for j in (i..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - for j in (i..n) { [INFO] [stdout] 51 + for j in i..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1110_delete_nodes_and_return_forest.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/s1123_lowest_common_ancestor_of_deepest_leaves.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/s1145_binary_tree_coloring_game.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1147_longest_chunked_palindrome_decomposition.rs:54:16 [INFO] [stdout] | [INFO] [stdout] 54 | if (i <= prev_token_end) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 54 - if (i <= prev_token_end) { [INFO] [stdout] 54 + if i <= prev_token_end { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1161_maximum_level_sum_of_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1171_remove_zero_sum_consecutive_nodes_from_linked_list.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:72:20 [INFO] [stdout] | [INFO] [stdout] 72 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:62:28 [INFO] [stdout] | [INFO] [stdout] 62 | let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 62 - let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] 62 + let s_single = cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | (cnt_max > 1 [INFO] [stdout] | ^ [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 | && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 ~ cnt_max > 1 [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 ~ && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (i % 2 != 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 55 - if (i % 2 != 0) { [INFO] [stdout] 55 + if i % 2 != 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:58:16 [INFO] [stdout] | [INFO] [stdout] 58 | if (map.contains_key(&(count - k))) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - if (map.contains_key(&(count - k))) { [INFO] [stdout] 58 + if map.contains_key(&(count - k)) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:61:16 [INFO] [stdout] | [INFO] [stdout] 61 | if (map.contains_key(&count)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - if (map.contains_key(&count)) { [INFO] [stdout] 61 + if map.contains_key(&count) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:65:25 [INFO] [stdout] | [INFO] [stdout] 65 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1278_palindrome_partitioning_iii.rs:71:19 [INFO] [stdout] | [INFO] [stdout] 71 | for ll in ((k - 1) as usize..l) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - for ll in ((k - 1) as usize..l) { [INFO] [stdout] 71 + for ll in (k - 1) as usize..l { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1290_convert_binary_number_in_a_linked_list_to_integer.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: `to_tree` [INFO] [stdout] --> src/solution/s1302_deepest_leaves_sum.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_tree` [INFO] [stdout] --> src/solution/s1305_all_elements_in_two_binary_search_trees.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_tree` [INFO] [stdout] --> src/solution/s1315_sum_of_nodes_with_even_valued_grandparent.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/s1325_delete_leaves_with_a_given_value.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: `to_tree` [INFO] [stdout] --> src/solution/s1339_maximum_product_of_splitted_binary_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 43 - if (left_child[i] != -1) { [INFO] [stdout] 43 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:46:16 [INFO] [stdout] | [INFO] [stdout] 46 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 46 - if (right_child[i] != -1) { [INFO] [stdout] 46 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | if (root < 0 || root >= n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (root < 0 || root >= n) { [INFO] [stdout] 53 + if root < 0 || root >= n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:63:16 [INFO] [stdout] | [INFO] [stdout] 63 | if (v.contains(&i)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - if (v.contains(&i)) { [INFO] [stdout] 63 + if v.contains(&i) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_child[i] != -1) { [INFO] [stdout] 69 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:72:16 [INFO] [stdout] | [INFO] [stdout] 72 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - if (right_child[i] != -1) { [INFO] [stdout] 72 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | 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/s1367_linked_list_in_binary_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1372_longest_zigzag_path_in_a_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1373_maximum_sum_bst_in_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1382_balance_a_binary_search_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let k = (k as usize); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - let k = (k as usize); [INFO] [stdout] 58 + let k = k as usize; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s1424_diagonal_traverse_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..len) { [INFO] [stdout] 53 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:58:18 [INFO] [stdout] | [INFO] [stdout] 58 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - for i in (0..len) { [INFO] [stdout] 58 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1448_count_good_nodes_in_binary_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/s1457_pseudo_palindromic_paths_in_a_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: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:50:62 [INFO] [stdout] | [INFO] [stdout] 50 | .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] 50 + .fold(target[0], |acc, z| acc + std::cmp::max(0, z.1 - z.0)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1530_number_of_good_leaf_nodes_pairs.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s1561_maximum_number_of_coins_you_can_get.rs:53:27 [INFO] [stdout] | [INFO] [stdout] 53 | piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] 53 + piles.iter().skip(piles.len() / 3).step_by(2).sum() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1609_even_odd_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: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1665_minimum_initial_energy_to_finish_tasks.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | result += (task[1] - result); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - result += (task[1] - result); [INFO] [stdout] 72 + result += task[1] - result; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashSet` [INFO] [stdout] --> src/solution/s0015_3sum.rs:82:9 [INFO] [stdout] | [INFO] [stdout] 82 | use std::collections::HashSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:73:20 [INFO] [stdout] | [INFO] [stdout] 73 | if (board[i][j] != '.') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (board[i][j] != '.') { [INFO] [stdout] 73 + if board[i][j] != '.' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:77:24 [INFO] [stdout] | [INFO] [stdout] 77 | if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 77 - if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] 77 + if used1[i][num] || used2[j][num] || used3[k][num] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:47:27 [INFO] [stdout] | [INFO] [stdout] 47 | } else if (j == n - 1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - } else if (j == n - 1) { [INFO] [stdout] 47 + } else if j == n - 1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:42:16 [INFO] [stdout] | [INFO] [stdout] 42 | if (nums[mid] == target) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 42 - if (nums[mid] == target) { [INFO] [stdout] 42 + if nums[mid] == target { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | } else if (nums[mid] > nums[h]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - } else if (nums[mid] > nums[h]) { [INFO] [stdout] 44 + } else if nums[mid] > nums[h] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..prices.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..prices.len()) { [INFO] [stdout] 53 + for i in 0..prices.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:50:20 [INFO] [stdout] | [INFO] [stdout] 50 | if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] 50 + if s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1]) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:39:15 [INFO] [stdout] | [INFO] [stdout] 39 | while (ugly_numbers.len() < n as usize) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 39 - while (ugly_numbers.len() < n as usize) { [INFO] [stdout] 39 + while ugly_numbers.len() < n as usize { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:47:16 [INFO] [stdout] | [INFO] [stdout] 47 | if (last == ugly_numbers[x] * 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - if (last == ugly_numbers[x] * 2) { [INFO] [stdout] 47 + if last == ugly_numbers[x] * 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:50:16 [INFO] [stdout] | [INFO] [stdout] 50 | if (last == ugly_numbers[y] * 3) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (last == ugly_numbers[y] * 3) { [INFO] [stdout] 50 + if last == ugly_numbers[y] * 3 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | if (last == ugly_numbers[z] * 5) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (last == ugly_numbers[z] * 5) { [INFO] [stdout] 53 + if last == ugly_numbers[z] * 5 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0278_first_bad_version.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/s0304_range_sum_query_2d_immutable.rs:96:9 [INFO] [stdout] | [INFO] [stdout] 96 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:44:28 [INFO] [stdout] | [INFO] [stdout] 44 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0329_longest_increasing_path_in_a_matrix.rs:83:9 [INFO] [stdout] | [INFO] [stdout] 83 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | if (size == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (size == 0) { [INFO] [stdout] 50 + if size == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:38:28 [INFO] [stdout] | [INFO] [stdout] 38 | answer.push(if (i % 15 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - answer.push(if (i % 15 == 0) { [INFO] [stdout] 38 + answer.push(if i % 15 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i % 3 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i % 3 == 0) { [INFO] [stdout] 41 + if i % 3 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | if (i % 5 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - if (i % 5 == 0) { [INFO] [stdout] 44 + if i % 5 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0421_maximum_xor_of_two_numbers_in_an_array.rs:72:9 [INFO] [stdout] | [INFO] [stdout] 72 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.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: `super::*` [INFO] [stdout] --> src/solution/s0470_implement_rand10_using_rand7.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s0475_heaters.rs:52:47 [INFO] [stdout] | [INFO] [stdout] 52 | _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] 52 + _ => (heaters[i] - h).min(h - heaters[i - 1]), [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0498_diagonal_traverse.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] 35 + if mat.len() == 0 || mat[0].len() == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0514_freedom_trail.rs:53:26 [INFO] [stdout] | [INFO] [stdout] 53 | for r_pos in (0..ring.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for r_pos in (0..ring.len()) { [INFO] [stdout] 53 + for r_pos in 0..ring.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0591_tag_validator.rs:130:9 [INFO] [stdout] | [INFO] [stdout] 130 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0600_non_negative_integers_without_consecutive_ones.rs:61:54 [INFO] [stdout] | [INFO] [stdout] 61 | FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] 61 + FB[bt - 1] + Self::find_integers(n & !(1 << bt)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0665_non_decreasing_array.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] 41 + if i < 2 || nums[i - 2] <= nums[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:61:33 [INFO] [stdout] | [INFO] [stdout] 61 | Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] 61 + Some(root) => match (root.borrow().left.clone(), root.borrow().right.clone()) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:69:24 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_val == root.borrow().val) { [INFO] [stdout] 69 + if left_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:73:24 [INFO] [stdout] | [INFO] [stdout] 73 | if (right_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (right_val == root.borrow().val) { [INFO] [stdout] 73 + if right_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0684_redundant_connection.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:70:20 [INFO] [stdout] | [INFO] [stdout] 70 | if (val < node.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 70 - if (val < node.borrow().val) { [INFO] [stdout] 70 + if val < node.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | if (val <= curr_kth) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - if (val <= curr_kth) { [INFO] [stdout] 71 + if val <= curr_kth { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0740_delete_and_earn.rs:48:50 [INFO] [stdout] | [INFO] [stdout] 48 | (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 48 - (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] 48 + (2..10001).for_each(|i| dp[i] = i32::max(sum[i] + dp[i - 2], dp[i - 1])); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:51:40 [INFO] [stdout] | [INFO] [stdout] 51 | tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] 51 + tx -= std::cmp::max(1, (tx - sx) / ty) * ty; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:53:40 [INFO] [stdout] | [INFO] [stdout] 53 | ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] 53 + ty -= std::cmp::max(1, (ty - sy) / tx) * tx; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::util::linked_list` [INFO] [stdout] --> src/solution/s0817_linked_list_components.rs:76:9 [INFO] [stdout] | [INFO] [stdout] 76 | use crate::util::linked_list; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0830_positions_of_large_groups.rs:49:18 [INFO] [stdout] | [INFO] [stdout] 49 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 49 - for i in (1..n) { [INFO] [stdout] 49 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s0843_guess_the_word.rs:125:9 [INFO] [stdout] | [INFO] [stdout] 125 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:113:33 [INFO] [stdout] | [INFO] [stdout] 113 | keys |= (1 << (c - b'a')); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 113 - keys |= (1 << (c - b'a')); [INFO] [stdout] 113 + keys |= 1 << (c - b'a'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0878_nth_magical_number.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] 41 + let mut hi = n * std::cmp::min(a, b); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | if (arr[i] < arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 57 - if (arr[i] < arr[i - 1]) { [INFO] [stdout] 57 + if arr[i] < arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 60 - } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] 60 + } else if arr[i] > arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0995_minimum_number_of_k_consecutive_bit_flips.rs:51:16 [INFO] [stdout] | [INFO] [stdout] 51 | if (i >= k) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (i >= k) { [INFO] [stdout] 51 + if i >= k { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s1039_minimum_score_triangulation_of_polygon.rs:86:9 [INFO] [stdout] | [INFO] [stdout] 86 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1105_filling_bookcase_shelves.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | for j in (i..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - for j in (i..n) { [INFO] [stdout] 51 + for j in i..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1147_longest_chunked_palindrome_decomposition.rs:54:16 [INFO] [stdout] | [INFO] [stdout] 54 | if (i <= prev_token_end) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 54 - if (i <= prev_token_end) { [INFO] [stdout] 54 + if i <= prev_token_end { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:72:20 [INFO] [stdout] | [INFO] [stdout] 72 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s1203_sort_items_by_groups_respecting_dependencies.rs:131:9 [INFO] [stdout] | [INFO] [stdout] 131 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:62:28 [INFO] [stdout] | [INFO] [stdout] 62 | let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 62 - let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] 62 + let s_single = cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | (cnt_max > 1 [INFO] [stdout] | ^ [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 | && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 ~ cnt_max > 1 [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 ~ && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (i % 2 != 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 55 - if (i % 2 != 0) { [INFO] [stdout] 55 + if i % 2 != 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:58:16 [INFO] [stdout] | [INFO] [stdout] 58 | if (map.contains_key(&(count - k))) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - if (map.contains_key(&(count - k))) { [INFO] [stdout] 58 + if map.contains_key(&(count - k)) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:61:16 [INFO] [stdout] | [INFO] [stdout] 61 | if (map.contains_key(&count)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - if (map.contains_key(&count)) { [INFO] [stdout] 61 + if map.contains_key(&count) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1278_palindrome_partitioning_iii.rs:71:19 [INFO] [stdout] | [INFO] [stdout] 71 | for ll in ((k - 1) as usize..l) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - for ll in ((k - 1) as usize..l) { [INFO] [stdout] 71 + for ll in (k - 1) as usize..l { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 43 - if (left_child[i] != -1) { [INFO] [stdout] 43 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:46:16 [INFO] [stdout] | [INFO] [stdout] 46 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 46 - if (right_child[i] != -1) { [INFO] [stdout] 46 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | if (root < 0 || root >= n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (root < 0 || root >= n) { [INFO] [stdout] 53 + if root < 0 || root >= n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:63:16 [INFO] [stdout] | [INFO] [stdout] 63 | if (v.contains(&i)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - if (v.contains(&i)) { [INFO] [stdout] 63 + if v.contains(&i) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_child[i] != -1) { [INFO] [stdout] 69 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:72:16 [INFO] [stdout] | [INFO] [stdout] 72 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - if (right_child[i] != -1) { [INFO] [stdout] 72 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let k = (k as usize); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - let k = (k as usize); [INFO] [stdout] 58 + let k = k as usize; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s1424_diagonal_traverse_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..len) { [INFO] [stdout] 53 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:58:18 [INFO] [stdout] | [INFO] [stdout] 58 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - for i in (0..len) { [INFO] [stdout] 58 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:50:62 [INFO] [stdout] | [INFO] [stdout] 50 | .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] 50 + .fold(target[0], |acc, z| acc + std::cmp::max(0, z.1 - z.0)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s1561_maximum_number_of_coins_you_can_get.rs:53:27 [INFO] [stdout] | [INFO] [stdout] 53 | piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] 53 + piles.iter().skip(piles.len() / 3).step_by(2).sum() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s1576_replace_all_s_to_avoid_consecutive_repeating_characters.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s1608_special_array_with_x_elements_greater_than_or_equal_x.rs:78:9 [INFO] [stdout] | [INFO] [stdout] 78 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/solution/s1617_count_subtrees_with_max_distance_between_cities.rs:109:9 [INFO] [stdout] | [INFO] [stdout] 109 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1665_minimum_initial_energy_to_finish_tasks.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | result += (task[1] - result); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - result += (task[1] - result); [INFO] [stdout] 72 + result += task[1] - result; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 46 | / loop { [INFO] [stdout] 47 | | match heap.len() { [INFO] [stdout] 48 | | 0 => { [INFO] [stdout] 49 | | return 0; [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 65 | 1 [INFO] [stdout] | ^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: `#[ignore]` only has an effect on functions [INFO] [stdout] --> src/solution/s1203_sort_items_by_groups_respecting_dependencies.rs:107:1 [INFO] [stdout] | [INFO] [stdout] 107 | #[ignore] [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_attributes)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `subp` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:160:24 [INFO] [stdout] | [INFO] [stdout] 160 | ([x, b'*', subp @ ..], [y, subs @ ..]) if *x == b'.' || x == y => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_subp` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec = Vec::new(); [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/s0039_combination_sum.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | 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:48:13 [INFO] [stdout] | [INFO] [stdout] 48 | 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:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:33:13 [INFO] [stdout] | [INFO] [stdout] 33 | for i in 0..n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:38:25 [INFO] [stdout] | [INFO] [stdout] 38 | let (mut l, mut mid, mut h) = (0, 0, nums.len() - 1); [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | for i in 0..deque.len() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | for i in 0..8 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0179_largest_number.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut result = vs.join(""); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:65:22 [INFO] [stdout] | [INFO] [stdout] 65 | Some(n) => (), [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut temp = std::cmp::max(pre + nums[i], cur); [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/s0219_contains_duplicate_ii.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | let mut prev = m.entry(x).or_insert(i); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0278_first_bad_version.rs:41:37 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn first_bad_version(&self, n: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:57:27 [INFO] [stdout] | [INFO] [stdout] 57 | .scan(0, |mut state, x| { [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/s0341_flatten_nested_list_iterator.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [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/s0341_flatten_nested_list_iterator.rs:76:15 [INFO] [stdout] | [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:39:24 [INFO] [stdout] | [INFO] [stdout] 39 | .filter(|&(x, y)| y >= 2) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:40:23 [INFO] [stdout] | [INFO] [stdout] 40 | .map(|(x, y)| (x + 1) as i32) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_y` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0502_ipo.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0509_fibonacci_number.rs:51:21 [INFO] [stdout] | [INFO] [stdout] 51 | 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: `n` [INFO] [stdout] --> src/solution/s0646_maximum_length_of_pair_chain.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = pairs.len() - 1; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0658_find_k_closest_elements.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let mut result = &mut arr[0..(k as 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/s0676_implement_magic_dictionary.rs:100:13 [INFO] [stdout] | [INFO] [stdout] 100 | let mut v = unsafe { search_word.as_bytes_mut() }; [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/s0684_redundant_connection.rs:39:13 [INFO] [stdout] | [INFO] [stdout] 39 | let mut tmp = 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/s0687_longest_univalue_path.rs:62:17 [INFO] [stdout] | [INFO] [stdout] 62 | let mut left_max = Self::dfs_helper(&root.borrow().left, cur); [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/s0687_longest_univalue_path.rs:63:17 [INFO] [stdout] | [INFO] [stdout] 63 | let mut right_max = Self::dfs_helper(&root.borrow().right, cur); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tail` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | if let Some((&tail, &height)) = map.range(..end).last() { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_tail` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:78:36 [INFO] [stdout] | [INFO] [stdout] 78 | while let Some((&key, &height)) = iter.next() { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/solution/s0764_largest_plus_sign.rs:44:17 [INFO] [stdout] | [INFO] [stdout] 44 | let mut count = 0; [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/s0770_basic_calculator_iv.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | let mut op = if subtract { -1 } else { 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/s0770_basic_calculator_iv.rs:234:13 [INFO] [stdout] | [INFO] [stdout] 234 | let mut it = &mut iter; [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/s0771_jewels_and_stones.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut set = jewels.chars().collect::>(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0779_k_th_symbol_in_grammar.rs:47:24 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn kth_grammar(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `max` is never read [INFO] [stdout] --> src/solution/s0798_smallest_rotation_with_highest_score.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | let mut max = 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 `row_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut row_sum = 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 `col_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:83:17 [INFO] [stdout] | [INFO] [stdout] 83 | let mut col_sum = 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 `num` is never read [INFO] [stdout] --> src/solution/s0842_split_array_into_fibonacci_sequence.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut num = 0i64; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word` [INFO] [stdout] --> src/solution/s0843_guess_the_word.rs:56:24 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn guess(self, word: String) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_word` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0846_hand_of_straights.rs:48:37 [INFO] [stdout] | [INFO] [stdout] 48 | if let Some(mut x) = map.get_mut(&(it + i)).or(Some(&mut 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/s0850_rectangle_area_ii.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut xi = xs.binary_search(&rec[0]).unwrap(); [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/s0850_rectangle_area_ii.rs:59:21 [INFO] [stdout] | [INFO] [stdout] 59 | let mut yi = ys.binary_search(&rec[1]).unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `current_iter` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | for current_iter in 0..queue_size { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_iter` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `front_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:55:25 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_front_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_s2_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:46:17 [INFO] [stdout] | [INFO] [stdout] 46 | let mut queue_size = queue.len(); [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/s0854_k_similar_strings.rs:55:21 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [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/s0854_k_similar_strings.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [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/s0854_k_similar_strings.rs:87:17 [INFO] [stdout] | [INFO] [stdout] 87 | let mut slice = s.as_bytes_mut(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `target_val` is never read [INFO] [stdout] --> src/solution/s0855_exam_room.rs:106:21 [INFO] [stdout] | [INFO] [stdout] 106 | target_val = self.n - 1; [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/s0864_shortest_path_to_get_all_keys.rs:82:13 [INFO] [stdout] | [INFO] [stdout] 82 | let mut all_keys = (1 << max) - 1; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `len` [INFO] [stdout] --> src/solution/s0866_prime_palindrome.rs:51:25 [INFO] [stdout] | [INFO] [stdout] 51 | let len = s.len(); [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0867_transpose_matrix.rs:43:29 [INFO] [stdout] | [INFO] [stdout] 43 | let mut vec: Vec = vec![*v2]; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s0874_walking_robot_simulation.rs:91:21 [INFO] [stdout] | [INFO] [stdout] 91 | for k in 0..cmd { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `piles` [INFO] [stdout] --> src/solution/s0877_stone_game.rs:42:23 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn stone_game(piles: Vec) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | for i in 1..=len { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 1..=len { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | for i in 1..=len { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:80:25 [INFO] [stdout] | [INFO] [stdout] 80 | for i in 1..=len { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0897_increasing_order_search_tree.rs:55:13 [INFO] [stdout] | [INFO] [stdout] 55 | let mut dm = Rc::new(RefCell::new(TreeNode::new(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/s0928_minimize_malware_spread_ii.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | let mut result: Vec<(i32, std::collections::HashSet)> = initial [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0959_regions_cut_by_slashes.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = grid.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s0964_least_operators_to_express_number.rs:68:25 [INFO] [stdout] | [INFO] [stdout] 68 | let mut r = i32::MAX; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s1002_find_common_characters.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | .filter(|(i, c)| **c > 0) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut v1 = heap.pop().unwrap(); [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/s1046_last_stone_weight.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let mut v2 = heap.pop().unwrap(); [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/s1053_previous_permutation_with_one_swap.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let mut arr = arr; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s1093_statistics_from_a_large_sample.rs:69:17 [INFO] [stdout] | [INFO] [stdout] 69 | let mut mid = 0.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 `r` is never read [INFO] [stdout] --> src/solution/s1096_brace_expansion_ii.rs:89:21 [INFO] [stdout] | [INFO] [stdout] 89 | let mut r = 0; [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/s1096_brace_expansion_ii.rs:79:17 [INFO] [stdout] | [INFO] [stdout] 79 | let mut str = stack.pop().unwrap(); [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/s1110_delete_nodes_and_return_forest.rs:61:13 [INFO] [stdout] | [INFO] [stdout] 61 | let mut root = root; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `this_sum` [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:29 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_this_sum` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `count` is assigned to, but never used [INFO] [stdout] --> src/solution/s1162_as_far_from_land_as_possible.rs:40:17 [INFO] [stdout] | [INFO] [stdout] 40 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_count` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1178_number_of_valid_words_for_each_puzzle.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut words = words [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/s1178_number_of_valid_words_for_each_puzzle.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let mut puzzles = puzzles [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1202_smallest_string_with_swaps.rs:96:14 [INFO] [stdout] | [INFO] [stdout] 96 | for (k, v) in map.iter() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1340_jump_game_v.rs:54:25 [INFO] [stdout] | [INFO] [stdout] 54 | .map(|(idx, num)| Self::dfs(&arr, &mut memo, d as usize, idx)) [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `i` is assigned to, but never used [INFO] [stdout] --> src/solution/s1371_find_the_longest_substring_containing_vowels_in_even_counts.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut i = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_i` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:47:28 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_performance(n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1464_maximum_product_of_two_elements_in_an_array.rs:54:23 [INFO] [stdout] | [INFO] [stdout] 54 | .fold(1, |mut res, x| res * (x - 1)) [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `str2` is never read [INFO] [stdout] --> src/solution/s1487_making_file_names_unique.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut str2 = String::new(); [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable pattern [INFO] [stdout] --> src/solution/s1514_path_with_maximum_probability.rs:94:17 [INFO] [stdout] | [INFO] [stdout] 82 | Pair(prob, curr) => { [INFO] [stdout] | ---------------- matches any value [INFO] [stdout] ... [INFO] [stdout] 94 | _ => (), [INFO] [stdout] | ^ no value can reach this [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1582_special_positions_in_a_binary_matrix.rs:44:27 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, v)| { [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/s1582_special_positions_in_a_binary_matrix.rs:44:36 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, v)| { [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/s1593_split_a_string_into_the_max_number_of_unique_substrings.rs:62:21 [INFO] [stdout] | [INFO] [stdout] 62 | let mut substr = [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `l` [INFO] [stdout] --> src/solution/s1606_find_servers_that_handled_most_number_of_requests.rs:72:31 [INFO] [stdout] | [INFO] [stdout] 72 | while let Some((&t2, &l)) = iterator.peek() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_l` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1614_maximum_nesting_depth_of_the_parentheses.rs:43:23 [INFO] [stdout] | [INFO] [stdout] 43 | .scan(0, |mut state, c| { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `orders` is never read [INFO] [stdout] --> src/solution/s1648_sell_diminishing_valued_colored_balls.rs:70:9 [INFO] [stdout] | [INFO] [stdout] 70 | orders = 0; [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/s1657_determine_if_two_strings_are_close.rs:59:27 [INFO] [stdout] | [INFO] [stdout] 59 | let (mut word1_v, mut word1_c) = [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/s1657_determine_if_two_strings_are_close.rs:70:27 [INFO] [stdout] | [INFO] [stdout] 70 | let (mut word2_v, mut word2_c) = [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0001_two_sum.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | 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 `two_sum` is never used [INFO] [stdout] --> src/solution/s0001_two_sum.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_two_numbers` is never used [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 65 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0003_longest_substring_without_repeating_characters.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/solution/s0003_longest_substring_without_repeating_characters.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0005_longest_palindromic_substring.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_palindrome` and `is_palindrome` are never used [INFO] [stdout] --> src/solution/s0005_longest_palindromic_substring.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 42 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn is_palindrome(s: &Vec, begin: usize, end: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0006_zigzag_conversion.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert` is never used [INFO] [stdout] --> src/solution/s0006_zigzag_conversion.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reverse` and `reverse_v2` are never used [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn reverse_v2(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0008_string_to_integer_atoi.rs:97:12 [INFO] [stdout] | [INFO] [stdout] 97 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `my_atoi` and `my_atoi_v2` are never used [INFO] [stdout] --> src/solution/s0008_string_to_integer_atoi.rs:105:12 [INFO] [stdout] | [INFO] [stdout] 104 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 105 | pub fn my_atoi(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 137 | pub fn my_atoi_v2(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0009_palindrome_number.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/solution/s0009_palindrome_number.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `CharMatcher` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:60:6 [INFO] [stdout] | [INFO] [stdout] 60 | enum CharMatcher { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `does_match` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 65 | impl CharMatcher { [INFO] [stdout] | ---------------- method in this implementation [INFO] [stdout] 66 | pub fn does_match(&self, ch: char) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Pattern` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:75:6 [INFO] [stdout] | [INFO] [stdout] 75 | enum Pattern { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `can_match_zero_chars` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 80 | impl Pattern { [INFO] [stdout] | ------------ method in this implementation [INFO] [stdout] 81 | pub fn can_match_zero_chars(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parse_pattern` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:89:4 [INFO] [stdout] | [INFO] [stdout] 89 | fn parse_pattern(p: &str) -> Result, &'static str> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_match`, `is_match_v2`, and `is_match_slice` are never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:149:12 [INFO] [stdout] | [INFO] [stdout] 148 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 149 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | pub fn is_match_v2(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn is_match_slice(s: &[u8], p: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_area` is never used [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0012_integer_to_roman.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `int_to_roman`, `int_to_roman_v2`, and `int_to_roman_v3` are never used [INFO] [stdout] --> src/solution/s0012_integer_to_roman.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 64 | pub fn int_to_roman(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 113 | pub fn int_to_roman_v2(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | pub fn int_to_roman_v3(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0013_roman_to_integer.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `roman_to_int` is never used [INFO] [stdout] --> src/solution/s0013_roman_to_integer.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 66 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 67 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0014_longest_common_prefix.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_common_prefix`, `longest_common_prefix_v2`, and `longest_common_prefix_v3` are never used [INFO] [stdout] --> src/solution/s0014_longest_common_prefix.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 34 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn longest_common_prefix_v2(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn longest_common_prefix_v3(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `three_sum` is never used [INFO] [stdout] --> src/solution/s0015_3sum.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum_closest` is never used [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0017_letter_combinations_of_a_phone_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `DIGIT_TO_CHAR` and `letter_combinations` are never used [INFO] [stdout] --> src/solution/s0017_letter_combinations_of_a_phone_number.rs:38:11 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 38 | const DIGIT_TO_CHAR: [&'static str; 10] = [ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0018_4sum.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `four_sum` and `four_sum_v2` are never used [INFO] [stdout] --> src/solution/s0018_4sum.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 30 | // Brute force may be AC, O(n^4), about 100ms [INFO] [stdout] 31 | pub fn four_sum(nums: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn four_sum_v2(nums: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_nth_from_end` is never used [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `merge_two_lists`, `merge_two_lists_v2`, and `merge_two_lists_recursive` are never used [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 54 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | pub fn merge_two_lists_v2( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn merge_two_lists_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_parenthesis`, `generate_parenthesis_recursive`, and `generate_parenthesis_v2` are never used [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 26 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn generate_parenthesis_recursive(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn generate_parenthesis_v2(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_k_lists` is never used [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:82:12 [INFO] [stdout] | [INFO] [stdout] 80 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 81 | // Credit: https://leetcode.com/problems/merge-k-sorted-lists/discuss/221538/rust-4ms-no-clone [INFO] [stdout] 82 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `swap_pairs`, `swap_pairs_recursive`, and `swap_pairs_v2` are never used [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 55 | // Recursiver verion [INFO] [stdout] 56 | pub fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn swap_pairs_recursive(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn swap_pairs_v2(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reverse_k_group` and `reverse` are never used [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 65 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 66 | // Credit: https://leetcode.com/problems/reverse-nodes-in-k-group/discuss/222209/Rust-4-ms [INFO] [stdout] 67 | pub fn reverse_k_group(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn reverse(head: Option>, tail: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0026_remove_duplicates_from_sorted_array.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/solution/s0026_remove_duplicates_from_sorted_array.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0027_remove_element.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `remove_element` and `remove_element_v2` are never used [INFO] [stdout] --> src/solution/s0027_remove_element.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 49 | pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn remove_element_v2(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0028_implement_strstr.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `str_str` is never used [INFO] [stdout] --> src/solution/s0028_implement_strstr.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide` is never used [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_substring` is never used [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | // Credit: https://leetcode.com/problems/substring-with-concatenation-of-all-words/discuss/798407/Rust-Functional-programming-solution [INFO] [stdout] 44 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0031_next_permutation.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `next_permutation` and `next_permutation_v2` are never used [INFO] [stdout] --> src/solution/s0031_next_permutation.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 35 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn next_permutation_v2(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_valid_parentheses` is never used [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn longest_valid_parentheses(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0033_search_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 `search` is never used [INFO] [stdout] --> src/solution/s0033_search_in_rotated_sorted_array.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | // Credit: https://leetcode.com/problems/search-... [INFO] [stdout] 36 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_range` is never used [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_insert` is never used [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_sudoku` is never used [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `solve_sudoku`, `solve_backtrack`, and `is_grid_valid` are never used [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | // Credit: https://leetcode.com/problems/sudoku-solver/discuss/300781/Not-so-fast-but-easy-to-understand-Rust-solution [INFO] [stdout] 38 | pub fn solve_sudoku(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn solve_backtrack(grid: &mut [&mut [char]], cell: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn is_grid_valid(grid: &mut [&mut [char]], y: usize, x: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0038_count_and_say.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_and_say` is never used [INFO] [stdout] --> src/solution/s0038_count_and_say.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 54 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 44 | pub fn combination_sum2(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0041_first_missing_positive.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `first_missing_positive` and `first_missing_positive_v2` are never used [INFO] [stdout] --> src/solution/s0041_first_missing_positive.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | pub fn first_missing_positive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | pub fn first_missing_positive_v2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap` is never used [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `multiply` is never used [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn multiply(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_match` is never used [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | // Credit: https://leetcode.com/problems/wildcard-matching/discuss/442999/rust-solution-DP-O(n)-space [INFO] [stdout] 57 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `jump` is never used [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0046_permutations.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute` is never used [INFO] [stdout] --> src/solution/s0046_permutations.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | // Credit: https://leetcode.com/problems/permutations/discuss/505394/Rust-0ms.-Iterators-madness [INFO] [stdout] 32 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute_unique` is never used [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | // Credit: https://leetcode.com/problems/permutations-ii/discuss/714100/Rust-Backtracking [INFO] [stdout] 35 | pub fn permute_unique(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0050_powx_n.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `my_pow` is never used [INFO] [stdout] --> src/solution/s0050_powx_n.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn my_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0051_n_queens.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `solve_n_queens` is never used [INFO] [stdout] --> src/solution/s0051_n_queens.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | // Credit: https://leetcode.com/problems/n-queens/discuss/774044/Backtracking-in-Rust-100-in-both-speed-and-memory-usage [INFO] [stdout] 34 | pub fn solve_n_queens(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `QueenPositions` is never used [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:30:6 [INFO] [stdout] | [INFO] [stdout] 30 | type QueenPositions = Vec>; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `total_n_queens`, `count_queen_configs`, and `is_invalid_pos` are never used [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | // Credit: https://leetcode.com/problems/n-queens-ii/discuss/668640/Rust-backtracking-solution-with-O(n)-memory-and-0ms-runtime. [INFO] [stdout] 34 | pub fn total_n_queens(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn count_queen_configs(queens: &mut QueenPositions, row: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn is_invalid_pos(queens: &QueenPositions, row: i16, col: i16) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0054_spiral_matrix.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `spiral_order` is never used [INFO] [stdout] --> src/solution/s0054_spiral_matrix.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn spiral_order(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0055_jump_game.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_jump` is never used [INFO] [stdout] --> src/solution/s0055_jump_game.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insert` is never used [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | // Credit: https://leetcode.com/problems/insert-interval/discuss/844818/Rust-solution [INFO] [stdout] 52 | pub fn insert(intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0058_length_of_last_word.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_last_word` is never used [INFO] [stdout] --> src/solution/s0058_length_of_last_word.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn length_of_last_word(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `generate_matrix` is never used [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn generate_matrix(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_permutation` is never used [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | // Credit: https://leetcode.com/problems/permut... [INFO] [stdout] 41 | pub fn get_permutation(n: i32, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate_right` is never used [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths` is never used [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0063_unique_paths_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths_with_obstacles` is never used [INFO] [stdout] --> src/solution/s0063_unique_paths_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_path_sum` is never used [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0065_valid_number.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_number` is never used [INFO] [stdout] --> src/solution/s0065_valid_number.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn is_number(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0066_plus_one.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `plus_one` is never used [INFO] [stdout] --> src/solution/s0066_plus_one.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0067_add_binary.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_binary` is never used [INFO] [stdout] --> src/solution/s0067_add_binary.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn add_binary(a: String, b: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0068_text_justification.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `full_justify` is never used [INFO] [stdout] --> src/solution/s0068_text_justification.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 65 | pub fn full_justify(words: Vec, max_width: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0069_sqrtx.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `my_sqrt` is never used [INFO] [stdout] --> src/solution/s0069_sqrtx.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `climb_stairs` is never used [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0071_simplify_path.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `simplify_path` is never used [INFO] [stdout] --> src/solution/s0071_simplify_path.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn simplify_path(path: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 functions `min_distance` and `min_distance_v2` are never used [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn min_distance_v2(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `M`, `N`, and `set_zeroes` are never used [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:39:11 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 39 | const M: usize = 200; [INFO] [stdout] | ^ [INFO] [stdout] 40 | const N: usize = 200; [INFO] [stdout] | ^ [INFO] [stdout] 41 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_matrix` is never used [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `RED`, `WHITE`, `BLUE`, and `sort_colors` are never used [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:41:11 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 41 | const RED: i32 = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] 42 | const WHITE: i32 = 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] 43 | const BLUE: i32 = 2; [INFO] [stdout] | ^^^^ [INFO] [stdout] 44 | [INFO] [stdout] 45 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_window` is never used [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | // Credit: https://leetcode.com/problems/minimum-window-substring/discuss/549313/Rust-solution-for-reference [INFO] [stdout] 32 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0077_combinations.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combine` is never used [INFO] [stdout] --> src/solution/s0077_combinations.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `subsets` is never used [INFO] [stdout] --> src/solution/s0078_subsets.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0079_word_search.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `exist` is never used [INFO] [stdout] --> src/solution/s0079_word_search.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | // Credit: https://leetcode.com/problems/remove-duplicates-from-sorted-list-i... [INFO] [stdout] 50 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0084_largest_rectangle_in_histogram.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_rectangle_area` is never used [INFO] [stdout] --> src/solution/s0084_largest_rectangle_in_histogram.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn largest_rectangle_area(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `merge` and `maximal_rectangle` are never used [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 49 | fn merge(row1: &mut Vec, row2: &Vec, n: usize) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0086_partition_list.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `partition` is never used [INFO] [stdout] --> src/solution/s0086_partition_list.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn partition(head: Option>, x: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_scramble` is never used [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0088_merge_sorted_array.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/solution/s0088_merge_sorted_array.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0089_gray_code.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `gray_code` and `gray_code_v2` are never used [INFO] [stdout] --> src/solution/s0089_gray_code.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 42 | pub fn gray_code(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn gray_code_v2(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `subsets_with_dup` is never used [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn subsets_with_dup(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_decodings` and `num_decodings_v2` are never used [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 61 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | pub fn num_decodings_v2(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reverse_between`, `reverse`, and `append` are never used [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 52 | // Credit: https://leetcode.com/problems/reverse-linked-list-ii/discuss/808421/Rust-solution-no-stack-0ms. [INFO] [stdout] 53 | pub fn reverse_between( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn reverse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn append( [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `restore_ip_addresses` and `helper` are never used [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | // Credit: https://leetcode.com/problems/restore-ip-addresses/discuss/1119335/Rust-cheapest-and-best [INFO] [stdout] 38 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn helper(digits: &[u32], k: usize) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_traversal`, `inorder_traversal_v2`, and `helper` are never used [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 71 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 72 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | pub fn inorder_traversal_v2(mut root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn helper(r: &mut Option>>, order: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_trees` and `helper` are never used [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 51 | pub fn generate_trees(n: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn helper(l: i32, r: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `num_trees` is never used [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_interleave` is never used [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn is_interleave(s1: String, s2: String, s3: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_bst` is never used [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 59 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `recover_tree` is never used [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 55 | // Credit: https://leetcode.com/problems/recover-binary-search-tree/discuss/448826/Rust-Inorder-Solution [INFO] [stdout] 56 | pub fn recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0100_same_tree.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_same_tree` is never used [INFO] [stdout] --> src/solution/s0100_same_tree.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 57 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 58 | pub fn is_same_tree( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_symmetric` is never used [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `level_order` is never used [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `zigzag_level_order` is never used [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 73 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 74 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `level_order_bottom` is never used [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sorted_array_to_bst` is never used [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sorted_list_to_bst` and `helper` are never used [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:82:12 [INFO] [stdout] | [INFO] [stdout] 80 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 81 | // Credit: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/discuss/448982/Rust-O(logN)-Space-and-O(N)-Time [INFO] [stdout] 82 | pub fn sorted_list_to_bst(head: Option>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | fn helper(ptr: &mut &Option>, len: usize) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0110_balanced_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_balanced` is never used [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_depth` is never used [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0112_path_sum.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_path_sum` is never used [INFO] [stdout] --> src/solution/s0112_path_sum.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 59 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `path_sum` is never used [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 59 | pub fn path_sum(root: Option>>, target_sum: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `flatten` is never used [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0115_distinct_subsequences.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_distinct` and `num_distinct_v2` are never used [INFO] [stdout] --> src/solution/s0115_distinct_subsequences.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 44 | // Credit: https://leetcode.com/problems/distinct-subsequences/discuss/1041833/Rust-naive-recursion-with-memorization [INFO] [stdout] 45 | pub fn num_distinct(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | pub fn num_distinct_v2(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0118_pascals_triangle.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `generate` is never used [INFO] [stdout] --> src/solution/s0118_pascals_triangle.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0119_pascals_triangle_ii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_row` is never used [INFO] [stdout] --> src/solution/s0119_pascals_triangle_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn get_row(row_index: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0120_triangle.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/solution/s0120_triangle.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `max_profit` is never used [INFO] [stdout] --> src/solution/s0121_best_time_to_buy_and_sell_stock.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_path_sum` is never used [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0125_valid_palindrome.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/solution/s0125_valid_palindrome.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_ladders` and `recursive_result` are never used [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 46 | // Credit: https://leetcode.com/problems/word-ladder-ii/discuss/803444/Rust-8ms-solution-double-ended-BFS-%2B-DFS [INFO] [stdout] 47 | pub fn find_ladders( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn recursive_result( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `ladder_length` is never used [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_consecutive` is never used [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sum_numbers` is never used [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 67 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 68 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `solve` and `helper` are never used [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 35 | pub fn solve(board: &mut Vec>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn helper(board: &mut Vec>, i: usize, j: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 functions `partition`, `helper`, and `is_palindrome` are never used [INFO] [stdout] --> src/solution/s0131_palindrome_partitioning.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 28 | // Credit: https://leetcode.com/problems/palindrome-partitioning/discuss/932976/rust-DFS-simple-solution [INFO] [stdout] 29 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn helper(s: &Vec, cans: &mut Vec, res: &mut Vec>, idx: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn is_palindrome(s: &Vec, start: usize, end: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_cut` is never used [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn min_cut(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0134_gas_station.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_complete_circuit` is never used [INFO] [stdout] --> src/solution/s0134_gas_station.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 functions `candy` and `candy_v2` are never used [INFO] [stdout] --> src/solution/s0135_candy.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 41 | pub fn candy(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn candy_v2(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0136_single_number.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/solution/s0136_single_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0137_single_number_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `single_number` and `single_number_v2` are never used [INFO] [stdout] --> src/solution/s0137_single_number_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 29 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn single_number_v2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0139_word_break.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_break` is never used [INFO] [stdout] --> src/solution/s0139_word_break.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_break` is never used [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | // Credit: https://leetcode.com/problems/word-break-ii/discuss/1120649/Naive-Rust-recursion-(but-works-%3A) [INFO] [stdout] 42 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reorder_list`, `length`, `reverse`, and `merge` are never used [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 56 | // Credit: https://leetcode.com/problems/reorder-list/discuss/803111/Rust-4ms [INFO] [stdout] 57 | pub fn reorder_list(head: &mut Option>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn length(mut head: &Option>) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn reverse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn merge( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `preorder_traversal` is never used [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 69 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 70 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `postorder_traversal` is never used [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 68 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 69 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LRUCache` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, and `put` are never used [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl LRUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 61 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insertion_sort_list` is never used [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0148_sort_list.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_list` is never used [INFO] [stdout] --> src/solution/s0148_sort_list.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | // Credit: https://leetcode.com/problems/sort-list/discuss/477190/Rus... [INFO] [stdout] 55 | pub fn sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_points` and `gcd` are never used [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn max_points(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | fn gcd(u: i32, v: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `eval_rpn` and `eval_rpn_v2` are never used [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 48 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | pub fn eval_rpn_v2(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `reverse_words` is never used [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 55 | pub fn reverse_words(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0152_maximum_product_subarray.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_product` is never used [INFO] [stdout] --> src/solution/s0152_maximum_product_subarray.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0153_find_minimum_in_rotated_sorted_array.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/solution/s0153_find_minimum_in_rotated_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `find_min` is never used [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used [INFO] [stdout] --> src/solution/s0155_min_stack.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 56 | /** initialize your data structure here. */ [INFO] [stdout] 57 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn get_min(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_peak_element` is never used [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_gap` is never used [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | // Credit: https://leetcode.com/problems/maximum-gap/discuss/756567/Rust-translated [INFO] [stdout] 35 | pub fn maximum_gap(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0165_compare_version_numbers.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compare_version` is never used [INFO] [stdout] --> src/solution/s0165_compare_version_numbers.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | pub fn compare_version(version1: String, version2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `fraction_to_decimal` is never used [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0167_two_sum_ii_input_array_is_sorted.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/solution/s0167_two_sum_ii_input_array_is_sorted.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0168_excel_sheet_column_title.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert_to_title` is never used [INFO] [stdout] --> src/solution/s0168_excel_sheet_column_title.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | pub fn convert_to_title(column_number: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0169_majority_element.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `majority_element` is never used [INFO] [stdout] --> src/solution/s0169_majority_element.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `title_to_number` is never used [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn title_to_number(column_title: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0172_factorial_trailing_zeroes.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trailing_zeroes` is never used [INFO] [stdout] --> src/solution/s0172_factorial_trailing_zeroes.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `go_left`, `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 83 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 84 | fn go_left(stack: &mut Vec>>, mut node: Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0174_dungeon_game.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate_minimum_hp` is never used [INFO] [stdout] --> src/solution/s0174_dungeon_game.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | // Credit: https://leetcode.com/problems/dungeon-game/discuss/698571/Rust-DP-bottom-up-0ms-explanation-by-example. [INFO] [stdout] 40 | pub fn calculate_minimum_hp(dungeon: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0179_largest_number.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_number` is never used [INFO] [stdout] --> src/solution/s0179_largest_number.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn largest_number(nums: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0187_repeated_dna_sequences.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_repeated_dna_sequences` is never used [INFO] [stdout] --> src/solution/s0187_repeated_dna_sequences.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn find_repeated_dna_sequences(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `max_profit` is never used [INFO] [stdout] --> src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | // Credit: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/discuss/344517/Rust-0ms-2.5MB-dp [INFO] [stdout] 37 | pub fn max_profit(k: i32, prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0189_rotate_array.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/solution/s0189_rotate_array.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0190_reverse_bits.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_bits` is never used [INFO] [stdout] --> src/solution/s0190_reverse_bits.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0191_number_of_1_bits.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hamming_weight` is never used [INFO] [stdout] --> src/solution/s0191_number_of_1_bits.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn hamming_weight(n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0198_house_robber.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rob` is never used [INFO] [stdout] --> src/solution/s0198_house_robber.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `right_side_view` is never used [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_islands` is never used [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0201_bitwise_and_of_numbers_range.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `range_bitwise_and` is never used [INFO] [stdout] --> src/solution/s0201_bitwise_and_of_numbers_range.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0202_happy_number.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_happy` is never used [INFO] [stdout] --> src/solution/s0202_happy_number.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_elements` is never used [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn remove_elements(head: Option>, val: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0204_count_primes.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_primes` is never used [INFO] [stdout] --> src/solution/s0204_count_primes.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn count_primes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_list` is never used [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0207_course_schedule.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_finish` is never used [INFO] [stdout] --> src/solution/s0207_course_schedule.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Trie` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 55 | /** Initialize your data structure here. */ [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0209_minimum_size_subarray_sum.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sub_array_len` is never used [INFO] [stdout] --> src/solution/s0209_minimum_size_subarray_sum.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0210_course_schedule_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_order` is never used [INFO] [stdout] --> src/solution/s0210_course_schedule_ii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Trie` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `WordDictionary` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, `search`, and `search_trie` are never used [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 61 | /** Initialize your data structure here. */ [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn add_word(&mut self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn search_trie(trie: &Trie, word: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Trie` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_words` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 44 | // Credit: https://leetcode.com/problems/word-search-ii/discuss/712977/Rust-Trie-DFS-solution [INFO] [stdout] 45 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn dfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rob` and `helper` are never used [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 40 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn helper(nums: &Vec, l: usize, r: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `shortest_palindrome` is never used [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn shortest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0215_kth_largest_element_in_an_array.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_kth_largest` is never used [INFO] [stdout] --> src/solution/s0215_kth_largest_element_in_an_array.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn find_kth_largest(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum3` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 64 | pub fn combination_sum3(k: i32, n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn dfs_helper(k: i32, n: i32, start: i32, comb: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0217_contains_duplicate.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_duplicate` is never used [INFO] [stdout] --> src/solution/s0217_contains_duplicate.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_skyline` is never used [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | // Credit: https://leetcode.com/problems/the-skyline-problem/discuss/954648/Rust-priority-queue-solution [INFO] [stdout] 46 | pub fn get_skyline(buildings: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0219_contains_duplicate_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/solution/s0219_contains_duplicate_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0220_contains_duplicate_iii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_almost_duplicate` is never used [INFO] [stdout] --> src/solution/s0220_contains_duplicate_iii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn contains_nearby_almost_duplicate(nums: Vec, k: i32, t: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0221_maximal_square.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximal_square` is never used [INFO] [stdout] --> src/solution/s0221_maximal_square.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn maximal_square(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_nodes` is never used [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 59 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 60 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compute_area` is never used [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn compute_area( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate` is never used [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 60 | /** Initialize your data structure here. */ [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0227_basic_calculator_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate` is never used [INFO] [stdout] --> src/solution/s0227_basic_calculator_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `summary_ranges` is never used [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn summary_ranges(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0229_majority_element_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `majority_element` is never used [INFO] [stdout] --> src/solution/s0229_majority_element_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn majority_element(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest` is never used [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 55 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0231_power_of_two.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_power_of_two` is never used [INFO] [stdout] --> src/solution/s0231_power_of_two.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn is_power_of_two(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 59 | /** Initialize your data structure here. */ [INFO] [stdout] 60 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn peek(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_digit_one` is never used [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn count_digit_one(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `helper` are never used [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 63 | // Credit: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/discuss/963346/Rust-recursive [INFO] [stdout] 64 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn helper(root: Rc>, v1: i32, v2: i32) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0238_product_of_array_except_self.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_except_self` is never used [INFO] [stdout] --> src/solution/s0238_product_of_array_except_self.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0239_sliding_window_maximum.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sliding_window` is never used [INFO] [stdout] --> src/solution/s0239_sliding_window_maximum.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | // Credit: https://leetcode.com/problems/sliding-window-maximum/discuss/267853/Rust-4ms-deque [INFO] [stdout] 58 | pub fn max_sliding_window(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0240_search_a_2d_matrix_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_matrix` is never used [INFO] [stdout] --> src/solution/s0240_search_a_2d_matrix_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0241_different_ways_to_add_parentheses.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `diff_ways_to_compute` is never used [INFO] [stdout] --> src/solution/s0241_different_ways_to_add_parentheses.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn diff_ways_to_compute(expression: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0242_valid_anagram.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_anagram` is never used [INFO] [stdout] --> src/solution/s0242_valid_anagram.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `binary_tree_paths` is never used [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn binary_tree_paths(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0258_add_digits.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_digits` is never used [INFO] [stdout] --> src/solution/s0258_add_digits.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn add_digits(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0260_single_number_iii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/solution/s0260_single_number_iii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn single_number(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0263_ugly_number.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_ugly` is never used [INFO] [stdout] --> src/solution/s0263_ugly_number.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn is_ugly(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `nth_ugly_number` is never used [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn nth_ugly_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0268_missing_number.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `missing_number` is never used [INFO] [stdout] --> src/solution/s0268_missing_number.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn missing_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `number_to_words` and `magnitude` are never used [INFO] [stdout] --> src/solution/s0273_integer_to_english_words.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 32 | // Credit: https://leetcode.com/problems/integer-to-english-words/discuss/397108/Rust-Solution-(Just-pattern-matching-and-recursion!) [INFO] [stdout] 33 | pub fn number_to_words(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn magnitude(name: &str, number: i32, magnitude: i32) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0274_h_index.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `h_index` is never used [INFO] [stdout] --> src/solution/s0274_h_index.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn h_index(citations: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 `h_index` is never used [INFO] [stdout] --> src/solution/s0275_h_index_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn h_index(citations: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0278_first_bad_version.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `first_bad_version` is never used [INFO] [stdout] --> src/solution/s0278_first_bad_version.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- method in this implementation [INFO] [stdout] 41 | pub fn first_bad_version(&self, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0279_perfect_squares.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_squares` is never used [INFO] [stdout] --> src/solution/s0279_perfect_squares.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | // NOTE: https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem [INFO] [stdout] 34 | pub fn num_squares(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_operators` is never used [INFO] [stdout] --> src/solution/s0282_expression_add_operators.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn add_operators(num: String, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0283_move_zeroes.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `move_zeroes` is never used [INFO] [stdout] --> src/solution/s0283_move_zeroes.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn move_zeroes(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0287_find_the_duplicate_number.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_duplicate` is never used [INFO] [stdout] --> src/solution/s0287_find_the_duplicate_number.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn find_duplicate(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0289_game_of_life.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `game_of_life` is never used [INFO] [stdout] --> src/solution/s0289_game_of_life.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | // Credit: https://leetcode.com/problems/game-of-life/discuss/731924/Rust-Solution [INFO] [stdout] 48 | pub fn game_of_life(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0290_word_pattern.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_pattern` is never used [INFO] [stdout] --> src/solution/s0290_word_pattern.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn word_pattern(pattern: String, s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0292_nim_game.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_win_nim` is never used [INFO] [stdout] --> src/solution/s0292_nim_game.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn can_win_nim(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MedianFinder` is never constructed [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct MedianFinder { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `MedianFinder` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_num`, and `find_median` are never used [INFO] [stdout] --> src/solution/s0295_find_median_from_data_stream.rs:64:8 [INFO] [stdout] | [INFO] [stdout] 62 | impl MedianFinder { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 63 | /** initialize your data structure here. */ [INFO] [stdout] 64 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add_num(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn find_median(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, `preorder_dfs`, `deserialize`, and `build_tree` are never used [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:70:8 [INFO] [stdout] | [INFO] [stdout] 69 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 70 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn preorder_dfs(node: Option>>, res: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn build_tree(src: &[Option], cur: &mut usize) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0299_bulls_and_cows.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_hint` is never used [INFO] [stdout] --> src/solution/s0299_bulls_and_cows.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn get_hint(secret: String, guess: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0300_longest_increasing_subsequence.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_lis` is never used [INFO] [stdout] --> src/solution/s0300_longest_increasing_subsequence.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_invalid_parentheses` is never used [INFO] [stdout] --> src/solution/s0301_remove_invalid_parentheses.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | // Credit: https://leetcode.com/problems/remove-invalid-parentheses/discuss/864630/Rust-translated-0ms-100 [INFO] [stdout] 39 | pub fn remove_invalid_parentheses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct NumArray(Vec); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_range` are never used [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct NumMatrix(Vec>); [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/solution/s0304_range_sum_query_2d_immutable.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 52 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 53 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0306_additive_number.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_additive_number` is never used [INFO] [stdout] --> src/solution/s0306_additive_number.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn is_additive_number(num: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct NumArray(Vec); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/solution/s0307_range_sum_query_mutable.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0310_minimum_height_trees.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min_height_trees` is never used [INFO] [stdout] --> src/solution/s0310_minimum_height_trees.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn find_min_height_trees(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0312_burst_balloons.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_coins` is never used [INFO] [stdout] --> src/solution/s0312_burst_balloons.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn max_coins(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0313_super_ugly_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `nth_super_ugly_number` is never used [INFO] [stdout] --> src/solution/s0313_super_ugly_number.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | // Credit: https://leetcode.com/problems/super-ugly-number/discuss/1349583/Rust-dp [INFO] [stdout] 39 | pub fn nth_super_ugly_number(n: i32, primes: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_smaller` is never used [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | // Creit: https://leetcode.com/problems/count-of-smaller-numbers-after-self/discuss/889481/24-ms-Rust-simple-solution [INFO] [stdout] 42 | pub fn count_smaller(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0316_remove_duplicate_letters.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `remove_duplicate_letters` and `remove_duplicate_letters_v2` are never used [INFO] [stdout] --> src/solution/s0316_remove_duplicate_letters.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 34 | // Credit: https://leetcode.com/problems/remove-duplicate-letters/discuss/1131952/Rust-cheapest-and-best [INFO] [stdout] 35 | pub fn remove_duplicate_letters(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn remove_duplicate_letters_v2(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0318_maximum_product_of_word_lengths.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_product` is never used [INFO] [stdout] --> src/solution/s0318_maximum_product_of_word_lengths.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn max_product(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0319_bulb_switcher.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `bulb_switch` is never used [INFO] [stdout] --> src/solution/s0319_bulb_switcher.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn bulb_switch(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0321_create_maximum_number.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_number`, `max_one`, `max_merge`, and `greater` are never used [INFO] [stdout] --> src/solution/s0321_create_maximum_number.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 41 | pub fn max_number(nums1: Vec, nums2: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn max_one(nums: &[i32], k: usize) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | fn max_merge(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn greater(nums1: &[i32], nums2: &[i32], mut i: usize, mut j: usize) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0322_coin_change.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `coin_change` is never used [INFO] [stdout] --> src/solution/s0322_coin_change.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | // Credit: https://leetcode.com/problems/coin-change/discuss/1104496/Rust-DP-solution [INFO] [stdout] 51 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0324_wiggle_sort_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `wiggle_sort` is never used [INFO] [stdout] --> src/solution/s0324_wiggle_sort_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn wiggle_sort(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0326_power_of_three.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_power_of_three` is never used [INFO] [stdout] --> src/solution/s0326_power_of_three.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn is_power_of_three(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0327_count_of_range_sum.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_range_sum` and `count_sub_range_sum` are never used [INFO] [stdout] --> src/solution/s0327_count_of_range_sum.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 35 | // Credit: https://leetcode.com/problems/count-of-range-sum/discuss/1378661/Rust-Divide-and-Conquer-using-prefix-sum [INFO] [stdout] 36 | pub fn count_range_sum(nums: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn count_sub_range_sum( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0328_odd_even_linked_list.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `odd_even_list` is never used [INFO] [stdout] --> src/solution/s0328_odd_even_linked_list.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn odd_even_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0329_longest_increasing_path_in_a_matrix.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_increasing_path` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0329_longest_increasing_path_in_a_matrix.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 41 | // Credit: https://leetcode.com/problems/longest-increasing-path-in-a-matrix/discuss/1151594/Rust-DFS-solution [INFO] [stdout] 42 | pub fn longest_increasing_path(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn dfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0330_patching_array.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_patches` is never used [INFO] [stdout] --> src/solution/s0330_patching_array.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn min_patches(nums: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0331_verify_preorder_serialization_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_valid_serialization` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0331_verify_preorder_serialization_of_a_binary_tree.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 39 | // Credit: https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/discuss/1427546/Rust-recursive-solution [INFO] [stdout] 40 | pub fn is_valid_serialization(preorder: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn dfs_helper(iter: &mut impl std::iter::Iterator) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0332_reconstruct_itinerary.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_itinerary` is never used [INFO] [stdout] --> src/solution/s0332_reconstruct_itinerary.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | // Credit: https://leetcode.com/problems/reconstruct-itinerary/discuss/711550/Rust-solution [INFO] [stdout] 42 | pub fn find_itinerary(tickets: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0334_increasing_triplet_subsequence.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `increasing_triplet` is never used [INFO] [stdout] --> src/solution/s0334_increasing_triplet_subsequence.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn increasing_triplet(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0335_self_crossing.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_self_crossing` is never used [INFO] [stdout] --> src/solution/s0335_self_crossing.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | // Credit: https://leetcode.com/problems/self-crossing/discuss/79131/Java-Oms-with-explanation [INFO] [stdout] 39 | pub fn is_self_crossing(distance: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0336_palindrome_pairs.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `palindrome_pairs` is never used [INFO] [stdout] --> src/solution/s0336_palindrome_pairs.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | // Credit: https://leetcode.com/problems/palindrome-pairs/discuss/1269909/Rust-HashMap-solution-(48ms) [INFO] [stdout] 40 | pub fn palindrome_pairs(words: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0337_house_robber_iii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rob` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0337_house_robber_iii.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 56 | pub fn rob(root: Option>>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn dfs_helper(root: &Option>>) -> (i32, i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0338_counting_bits.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_bits` is never used [INFO] [stdout] --> src/solution/s0338_counting_bits.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn count_bits(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Int` and `List` are never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:49:5 [INFO] [stdout] | [INFO] [stdout] 48 | pub enum NestedInteger { [INFO] [stdout] | ------------- variants in this enum [INFO] [stdout] 49 | Int(i32), [INFO] [stdout] | ^^^ [INFO] [stdout] 50 | List(Vec), [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `NestedInteger` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NestedIterator` is never constructed [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:53:8 [INFO] [stdout] | [INFO] [stdout] 53 | struct NestedIterator { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, `has_next`, and `unnest` are never used [INFO] [stdout] --> src/solution/s0341_flatten_nested_list_iterator.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 61 | impl NestedIterator { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn has_next(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0342_power_of_four.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_power_of_four` is never used [INFO] [stdout] --> src/solution/s0342_power_of_four.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn is_power_of_four(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0343_integer_break.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `integer_break` is never used [INFO] [stdout] --> src/solution/s0343_integer_break.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn integer_break(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0344_reverse_string.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_string` is never used [INFO] [stdout] --> src/solution/s0344_reverse_string.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn reverse_string(s: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0345_reverse_vowels_of_a_string.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_vowels` is never used [INFO] [stdout] --> src/solution/s0345_reverse_vowels_of_a_string.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn reverse_vowels(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0347_top_k_frequent_elements.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `top_k_frequent` is never used [INFO] [stdout] --> src/solution/s0347_top_k_frequent_elements.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0349_intersection_of_two_arrays.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersection` is never used [INFO] [stdout] --> src/solution/s0349_intersection_of_two_arrays.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0350_intersection_of_two_arrays_ii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersect` is never used [INFO] [stdout] --> src/solution/s0350_intersection_of_two_arrays_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SummaryRanges` is never constructed [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct SummaryRanges { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `remove`, `insert`, `add_num`, and `get_intervals` are never used [INFO] [stdout] --> src/solution/s0352_data_stream_as_disjoint_intervals.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl SummaryRanges { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn remove(&mut self, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn insert(&mut self, l: i32, r: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn add_num(&mut self, val: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 107 | fn get_intervals(&self) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0354_russian_doll_envelopes.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_envelopes` is never used [INFO] [stdout] --> src/solution/s0354_russian_doll_envelopes.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | // Credit: https://leetcode.com/problems/russian-doll-envelopes/discuss/1134368/Rust-solution [INFO] [stdout] 37 | pub fn max_envelopes(envelopes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `tweets` and `follows` are never read [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:52:5 [INFO] [stdout] | [INFO] [stdout] 51 | pub struct Twitter { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] 52 | tweets: Vec<(Tweet, User)>, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 53 | follows: std::collections::HashSet<(User, User)>, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Twitter` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `post_tweet`, `get_news_feed`, `follow`, and `unfollow` are never used [INFO] [stdout] --> src/solution/s0355_design_twitter.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl Twitter { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn post_tweet(&mut self, user_id: User, tweet_id: Tweet) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn get_news_feed(&self, user_id: User) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn follow(&mut self, follower_id: User, followee_id: User) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | pub fn unfollow(&mut self, follower_id: User, followee_id: User) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0357_count_numbers_with_unique_digits.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_numbers_with_unique_digits` is never used [INFO] [stdout] --> src/solution/s0357_count_numbers_with_unique_digits.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn count_numbers_with_unique_digits(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0363_max_sum_of_rectangle_no_larger_than_k.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_submatrix` is never used [INFO] [stdout] --> src/solution/s0363_max_sum_of_rectangle_no_larger_than_k.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | // Credit: https://leetcode.com/problems/max-sum-of-rectangle... [INFO] [stdout] 40 | pub fn max_sum_submatrix(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0365_water_and_jug_problem.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_measure_water` is never used [INFO] [stdout] --> src/solution/s0365_water_and_jug_problem.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn can_measure_water(jug1_capacity: i32, jug2_capacity: i32, target_capacity: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0367_valid_perfect_square.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_perfect_square` is never used [INFO] [stdout] --> src/solution/s0367_valid_perfect_square.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn is_perfect_square(num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0368_largest_divisible_subset.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_divisible_subset` is never used [INFO] [stdout] --> src/solution/s0368_largest_divisible_subset.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn largest_divisible_subset(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0371_sum_of_two_integers.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_sum` is never used [INFO] [stdout] --> src/solution/s0371_sum_of_two_integers.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 26 | pub fn get_sum(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0372_super_pow.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `super_pow` is never used [INFO] [stdout] --> src/solution/s0372_super_pow.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn super_pow(a: i32, b: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0373_find_k_pairs_with_smallest_sums.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_smallest_pairs` is never used [INFO] [stdout] --> src/solution/s0373_find_k_pairs_with_smallest_sums.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn k_smallest_pairs(nums1: Vec, nums2: Vec, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: static `PICK` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | static mut PICK: i32 = 0; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `guess` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:41:11 [INFO] [stdout] | [INFO] [stdout] 41 | unsafe fn guess(num: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `guess_number` is never used [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:61:15 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | unsafe fn guess_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0375_guess_number_higher_or_lower_ii.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_money_amount` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0375_guess_number_higher_or_lower_ii.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 65 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 66 | pub fn get_money_amount(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn dfs_helper(start: usize, end: usize, dp: &mut Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `wiggle_max_length` is never used [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn wiggle_max_length(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0377_combination_sum_iv.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combination_sum4` is never used [INFO] [stdout] --> src/solution/s0377_combination_sum_iv.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn combination_sum4(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0378_kth_smallest_element_in_a_sorted_matrix.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest` is never used [INFO] [stdout] --> src/solution/s0378_kth_smallest_element_in_a_sorted_matrix.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | // Credit: https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/discuss/1322870/Rust-translated-binary-search-solution [INFO] [stdout] 38 | pub fn kth_smallest(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedSet` is never constructed [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:48:8 [INFO] [stdout] | [INFO] [stdout] 48 | struct RandomizedSet { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used [INFO] [stdout] --> src/solution/s0380_insert_delete_getrandom_o1.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl RandomizedSet { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 59 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn get_random(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedCollection` is never constructed [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct RandomizedCollection { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used [INFO] [stdout] --> src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 57 | impl RandomizedCollection { [INFO] [stdout] | ------------------------- associated items in this implementation [INFO] [stdout] 58 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 67 | pub struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `get_random` are never used [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 77 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 78 | fn new(head: Option>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0383_ransom_note.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_construct` is never used [INFO] [stdout] --> src/solution/s0383_ransom_note.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn can_construct(ransom_note: String, magazine: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0384_shuffle_an_array.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `reset`, and `shuffle` are never used [INFO] [stdout] --> src/solution/s0384_shuffle_an_array.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 54 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn reset(&mut self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn shuffle(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0385_mini_parser.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Int` and `List` are never constructed [INFO] [stdout] --> src/solution/s0385_mini_parser.rs:42:5 [INFO] [stdout] | [INFO] [stdout] 41 | pub enum NestedInteger { [INFO] [stdout] | ------------- variants in this enum [INFO] [stdout] 42 | Int(i32), [INFO] [stdout] | ^^^ [INFO] [stdout] 43 | List(Vec), [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `NestedInteger` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `deserialize` is never used [INFO] [stdout] --> src/solution/s0385_mini_parser.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | // Credit: https://leetcode.com/problems/mini-parser/discuss/829813/Rust(Safe)-Iterative-Time-O(N)-Space-O(N)-0ms-2.1mb [INFO] [stdout] 48 | pub fn deserialize(s: String) -> NestedInteger { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0386_lexicographical_numbers.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lexical_order` is never used [INFO] [stdout] --> src/solution/s0386_lexicographical_numbers.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn lexical_order(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0387_first_unique_character_in_a_string.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `first_uniq_char` is never used [INFO] [stdout] --> src/solution/s0387_first_unique_character_in_a_string.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn first_uniq_char(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0388_longest_absolute_file_path.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_longest_path` is never used [INFO] [stdout] --> src/solution/s0388_longest_absolute_file_path.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 64 | pub fn length_longest_path(input: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0389_find_the_difference.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_the_difference` is never used [INFO] [stdout] --> src/solution/s0389_find_the_difference.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn find_the_difference(s: String, t: String) -> char { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0390_elimination_game.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `last_remaining` is never used [INFO] [stdout] --> src/solution/s0390_elimination_game.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn last_remaining(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0391_perfect_rectangle.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_rectangle_cover` is never used [INFO] [stdout] --> src/solution/s0391_perfect_rectangle.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | // Credit: https://leetcode.com/problems/perfect-rectangle/discuss/867159/Rust-16ms-2mb-Time-O(N)-Space-O(N) [INFO] [stdout] 48 | pub fn is_rectangle_cover(rectangles: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0392_is_subsequence.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_subsequence` is never used [INFO] [stdout] --> src/solution/s0392_is_subsequence.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn is_subsequence(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0393_utf_8_validation.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `valid_utf8` is never used [INFO] [stdout] --> src/solution/s0393_utf_8_validation.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn valid_utf8(data: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0394_decode_string.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `decode_string` is never used [INFO] [stdout] --> src/solution/s0394_decode_string.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn decode_string(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0395_longest_substring_with_at_least_k_repeating_characters.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_substring` is never used [INFO] [stdout] --> src/solution/s0395_longest_substring_with_at_least_k_repeating_characters.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn longest_substring(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0396_rotate_function.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_rotate_function` is never used [INFO] [stdout] --> src/solution/s0396_rotate_function.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn max_rotate_function(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0397_integer_replacement.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `integer_replacement` is never used [INFO] [stdout] --> src/solution/s0397_integer_replacement.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn integer_replacement(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0398_random_pick_index.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `pick` are never used [INFO] [stdout] --> src/solution/s0398_random_pick_index.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 50 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn pick(&mut self, target: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0399_evaluate_division.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calc_equation` is never used [INFO] [stdout] --> src/solution/s0399_evaluate_division.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | // Credit: https://leetcode.com/problems/evaluate-division/discuss/799642/Rust-cheapest-and-best [INFO] [stdout] 51 | pub fn calc_equation( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0400_nth_digit.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_nth_digit` is never used [INFO] [stdout] --> src/solution/s0400_nth_digit.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn find_nth_digit(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0401_binary_watch.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `read_binary_watch` is never used [INFO] [stdout] --> src/solution/s0401_binary_watch.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn read_binary_watch(turned_on: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0402_remove_k_digits.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_kdigits` is never used [INFO] [stdout] --> src/solution/s0402_remove_k_digits.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | // Credit: https://leetcode.com/problems/remove-k-digits/discuss/629739/Rust-0ms-code-with-comments [INFO] [stdout] 41 | pub fn remove_kdigits(num: String, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0403_frog_jump.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `can_cross` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0403_frog_jump.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | pub fn can_cross(stones: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn dfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0404_sum_of_left_leaves.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sum_of_left_leaves` is never used [INFO] [stdout] --> src/solution/s0404_sum_of_left_leaves.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn sum_of_left_leaves(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0405_convert_a_number_to_hexadecimal.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `to_hex` is never used [INFO] [stdout] --> src/solution/s0405_convert_a_number_to_hexadecimal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn to_hex(num: i32) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0406_queue_reconstruction_by_height.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reconstruct_queue` is never used [INFO] [stdout] --> src/solution/s0406_queue_reconstruction_by_height.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn reconstruct_queue(people: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0407_trapping_rain_water_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap_rain_water` is never used [INFO] [stdout] --> src/solution/s0407_trapping_rain_water_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | // Credit: https://leetcode.com/problems/trapping-rain-water-ii/discuss/834255/Rust-translated-4ms-100 [INFO] [stdout] 37 | pub fn trap_rain_water(height_map: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0409_longest_palindrome.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_palindrome` is never used [INFO] [stdout] --> src/solution/s0409_longest_palindrome.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn longest_palindrome(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0410_split_array_largest_sum.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `split_array` is never used [INFO] [stdout] --> src/solution/s0410_split_array_largest_sum.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | // Credit: https://leetcode.com/problems/split-array-largest-sum/discuss/1308438/Rust-binary-search-solution [INFO] [stdout] 43 | pub fn split_array(nums: Vec, m: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `fizz_buzz` is never used [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn fizz_buzz(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0413_arithmetic_slices.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_arithmetic_slices` is never used [INFO] [stdout] --> src/solution/s0413_arithmetic_slices.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn number_of_arithmetic_slices(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0414_third_maximum_number.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `third_max` is never used [INFO] [stdout] --> src/solution/s0414_third_maximum_number.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn third_max(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0415_add_strings.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_strings` is never used [INFO] [stdout] --> src/solution/s0415_add_strings.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn add_strings(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0416_partition_equal_subset_sum.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_partition` is never used [INFO] [stdout] --> src/solution/s0416_partition_equal_subset_sum.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0417_pacific_atlantic_water_flow.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pacific_atlantic` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0417_pacific_atlantic_water_flow.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 36 | // Credit: https://leetcode.com/problems/pacific-atlantic-water-flow/discuss/1127040/Rust-DFS-solution [INFO] [stdout] 37 | pub fn pacific_atlantic(heights: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn dfs_helper(reachable: &mut Vec>, heights: &[Vec], (i, j): (usize, usize)) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0419_battleships_in_a_board.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_battleships` is never used [INFO] [stdout] --> src/solution/s0419_battleships_in_a_board.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn count_battleships(board: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0420_strong_password_checker.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `strong_password_checker`, `repeat_count`, `replace_count`, and `compu_type_count` are never used [INFO] [stdout] --> src/solution/s0420_strong_password_checker.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 42 | // Credit: https://leetcode.com/problems/strong-password-checker/discuss/1482857/Rust%3A-0-ms-faster-than-100.00or2-MB-less-than-100.00 [INFO] [stdout] 43 | pub fn strong_password_checker(password: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn repeat_count(password: &String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn replace_count( [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | pub fn compu_type_count(password: &String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0421_maximum_xor_of_two_numbers_in_an_array.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_maximum_xor` is never used [INFO] [stdout] --> src/solution/s0421_maximum_xor_of_two_numbers_in_an_array.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | // Credit: https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/discuss/804241/Rust-cheapest-and-best [INFO] [stdout] 47 | pub fn find_maximum_xor(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0423_reconstruct_original_digits_from_english.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `original_digits` is never used [INFO] [stdout] --> src/solution/s0423_reconstruct_original_digits_from_english.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn original_digits(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0424_longest_repeating_character_replacement.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Helper` is never constructed [INFO] [stdout] --> src/solution/s0424_longest_repeating_character_replacement.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | struct Helper { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `inc`, `find_max`, `dec`, and `validate` are never used [INFO] [stdout] --> src/solution/s0424_longest_repeating_character_replacement.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 43 | impl Helper { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 44 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn inc(&mut self, key: u8) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn find_max(&mut self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn dec(&mut self, key: u8) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn validate(&self, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `character_replacement` is never used [INFO] [stdout] --> src/solution/s0424_longest_repeating_character_replacement.rs:104:12 [INFO] [stdout] | [INFO] [stdout] 103 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 104 | pub fn character_replacement(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AllOne` is never constructed [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct AllOne { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `inc`, `dec`, `get_max_key`, and `get_min_key` are never used [INFO] [stdout] --> src/solution/s0432_all_oone_data_structure.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl AllOne { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn inc(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn dec(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn get_max_key(&self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn get_min_key(&self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0433_minimum_genetic_mutation.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_mutation` and `is_mutation` are never used [INFO] [stdout] --> src/solution/s0433_minimum_genetic_mutation.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 46 | // Credit: https://leetcode.com/problems/minimum-genetic-mutation/discuss/1181572/Rust-cheapest-and-best [INFO] [stdout] 47 | pub fn min_mutation(start: String, end: String, bank: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn is_mutation(a: &str, b: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0434_number_of_segments_in_a_string.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_segments` is never used [INFO] [stdout] --> src/solution/s0434_number_of_segments_in_a_string.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn count_segments(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0435_non_overlapping_intervals.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used [INFO] [stdout] --> src/solution/s0435_non_overlapping_intervals.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn erase_overlap_intervals(intervals: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0436_find_right_interval.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_right_interval` is never used [INFO] [stdout] --> src/solution/s0436_find_right_interval.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn find_right_interval(intervals: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0437_path_sum_iii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `path_sum` and `with_root_path_sum` are never used [INFO] [stdout] --> src/solution/s0437_path_sum_iii.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 55 | pub fn path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn with_root_path_sum(root: Option>>, target_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0438_find_all_anagrams_in_a_string.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_anagrams` is never used [INFO] [stdout] --> src/solution/s0438_find_all_anagrams_in_a_string.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | // Credit: https://leetcode.com/problems/find-all-ana... [INFO] [stdout] 40 | pub fn find_anagrams(s: String, p: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0440_k_th_smallest_in_lexicographical_order.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_kth_number` is never used [INFO] [stdout] --> src/solution/s0440_k_th_smallest_in_lexicographical_order.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn find_kth_number(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0441_arranging_coins.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `arrange_coins` is never used [INFO] [stdout] --> src/solution/s0441_arranging_coins.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn arrange_coins(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_duplicates` is never used [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn find_duplicates(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0443_string_compression.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compress` is never used [INFO] [stdout] --> src/solution/s0443_string_compression.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn compress(chars: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0445_add_two_numbers_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_two_numbers` is never used [INFO] [stdout] --> src/solution/s0445_add_two_numbers_ii.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 57 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 58 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0446_arithmetic_slices_ii_subsequence.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_arithmetic_slices` is never used [INFO] [stdout] --> src/solution/s0446_arithmetic_slices_ii_subsequence.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | // Credit: https://leetcode.com/problems/arithmetic-slices-ii-subsequence/discuss/1455360/Rust-solution [INFO] [stdout] 51 | pub fn number_of_arithmetic_slices(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0447_number_of_boomerangs.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_boomerangs` is never used [INFO] [stdout] --> src/solution/s0447_number_of_boomerangs.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn number_of_boomerangs(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0448_find_all_numbers_disappeared_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 `find_disappeared_numbers` is never used [INFO] [stdout] --> src/solution/s0448_find_all_numbers_disappeared_in_an_array.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn find_disappeared_numbers(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `to_rc` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:54:4 [INFO] [stdout] | [INFO] [stdout] 54 | fn to_rc(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `val_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:63:4 [INFO] [stdout] | [INFO] [stdout] 63 | fn val_of(root: &Option>>) -> Option { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `left_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:75:4 [INFO] [stdout] | [INFO] [stdout] 75 | fn left_of(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `right_of` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:90:4 [INFO] [stdout] | [INFO] [stdout] 90 | fn right_of(root: &Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `append_to_left` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:105:4 [INFO] [stdout] | [INFO] [stdout] 105 | fn append_to_left(root: &Option>>, val: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `append_to_right` is never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:120:4 [INFO] [stdout] | [INFO] [stdout] 120 | fn append_to_right( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:136:8 [INFO] [stdout] | [INFO] [stdout] 136 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, and `deserialize` are never used [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 142 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 143 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 186 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0450_delete_node_in_a_bst.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `delete_node`, `delete_node_helper`, and `search_next` are never used [INFO] [stdout] --> src/solution/s0450_delete_node_in_a_bst.rs:73:12 [INFO] [stdout] | [INFO] [stdout] 72 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 73 | pub fn delete_node( [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn delete_node_helper( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 114 | fn search_next(node: &Option>>) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0451_sort_characters_by_frequency.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `frequency_sort` is never used [INFO] [stdout] --> src/solution/s0451_sort_characters_by_frequency.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn frequency_sort(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0452_minimum_number_of_arrows_to_burst_balloons.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used [INFO] [stdout] --> src/solution/s0452_minimum_number_of_arrows_to_burst_balloons.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn find_min_arrow_shots(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0453_minimum_moves_to_equal_array_elements.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_moves` is never used [INFO] [stdout] --> src/solution/s0453_minimum_moves_to_equal_array_elements.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn min_moves(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0454_4sum_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `four_sum_count` is never used [INFO] [stdout] --> src/solution/s0454_4sum_ii.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn four_sum_count( [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0455_assign_cookies.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_content_children` is never used [INFO] [stdout] --> src/solution/s0455_assign_cookies.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn find_content_children(g: Vec, s: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0456_132_pattern.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find132pattern` is never used [INFO] [stdout] --> src/solution/s0456_132_pattern.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn find132pattern(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0457_circular_array_loop.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `circular_array_loop` and `next` are never used [INFO] [stdout] --> src/solution/s0457_circular_array_loop.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 61 | pub fn circular_array_loop(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | fn next(nums: &[i32], index: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0458_poor_pigs.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `poor_pigs` is never used [INFO] [stdout] --> src/solution/s0458_poor_pigs.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn poor_pigs(buckets: i32, minutes_to_die: i32, minutes_to_test: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0459_repeated_substring_pattern.rs:30:12 [WARN] too many lines in the log, truncating it