Leetcode Short [Rust | Vim] - A ListNode Utility (To Solve Problem 21)

preview_player
Показать описание
I'm working my way through the "Grind 75" Leetcode problems, as a sort of warmup to Advent of Code coming in December 2022. Be amazed at my solutions! Poke holes in my logic! Come up with tests that break my code!

In this one, we take a break from solving problems in order to implement the struct that's given in the problem we're trying to solve. The next video in the playlist is the one that actually uses the ListNode struct to solve a problem.

#rust #rustlang #programming #leetcode
  1. Uncle Scientist
Рекомендации по теме
Leetcode Short [Rust 0:07:43

Leetcode Short [Rust | Vim] - Problem 20: Valid Parentheses

Leetcode Short [Rust 0:17:14

Leetcode Short [Rust | Vim] - Problem 704: Binary Search

Leetcode Short [Rust 0:17:10

Leetcode Short [Rust | Vim] - Problem 973: K Closest Points to Origin

Leetcode Short [Rust 0:07:12

Leetcode Short [Rust | Vim] - Problem 876: Middle of the Linked List

Leetcode Short [Rust 0:29:05

Leetcode Short [Rust | Vim] - Problem 543: Diameter of Binary Tree

Leetcode Short [Rust 0:09:13

Leetcode Short [Rust | Vim] - Problem 121: Best Time to Buy and Sell Stock

Leetcode Short [Rust 0:08:33

Leetcode Short [Rust | Vim] - Problem 226: Invert Binary Tree

Leetcode Short [Rust 0:09:30

Leetcode Short [Rust | Vim] - Problem 409: Longest Palindrome

Leetcode Short [Rust 0:38:52

Leetcode Short [Rust | Vim] - Problem 542: 01 Matrix

Leetcode Short [Rust 0:08:01

Leetcode Short [Rust | Vim] - Problem 169: Majority Element

Leetcode Short [Rust 0:10:16

Leetcode Short [Rust | Vim] - Problem 110: Balanced Binary Tree

Leetcode Short [Rust 0:09:32

Leetcode Short [Rust | Vim] - A ListNode Utility (To Solve Problem 21)

Leetcode Short [Rust 0:13:07

Leetcode Short [Rust | Vim] - Problem 67: Add Binary

Leetcode Short [Rust 0:16:22

Leetcode Short [Rust | Vim] - Problem 65: Sort Colors

Leetcode Short [Rust 0:09:53

Leetcode Short [Rust | Vim] - Problem 1: Two Sum

Leetcode Short [Rust 0:04:07

Leetcode Short [Rust | Vim] - Problem 242: Valid Anagram

Leetcode Short [Rust 0:06:20

Leetcode Short [Rust | Vim] - Problem 217: Contains Duplicate

Leetcode Short [Rust 0:10:05

Leetcode Short [Rust | Vim] - Problem 125: Valid Palindrome

Leetcode Short [Rust 0:13:22

Leetcode Short [Rust | Vim] - Problem 70: Climbing Stairs

Leetcode Short [Rust 0:11:35

Leetcode Short [Rust | Vim] - Problem 155: Min Stack

Leetcode Short [Rust 0:13:11

Leetcode Short [Rust | Vim] - Problem 206: Reverse Linked List

Leetcode Short [Rust 0:05:19

Leetcode Short [Rust | Vim] - Problem 104: Maximum Depth of Binary Tree

Leetcode Short [Rust 0:17:47

Leetcode Short [Rust | Vim] - Problem 56: Merge Intervals

Leetcode Short [Rust 0:17:45

Leetcode Short [Rust | Vim] - Problem 98: Validate Binary Search Tree

Комментарии
Автор

I would probably go with the ‹From› trait :) but I can see the issue with mismatched types :/
also regarding the tests, it is dependant on your implementation, if you were building the linked list from the start and used the same tests, it would be false negative if the created list was shorter

mtt_
Автор

What is that test runner you are using ?

swastikacharyya