Try   HackMD

121. Best Time to Buy and Sell Stock


Optimal Space & Time Complexity 
- Time complexity:
- Space complexity:

Solutions

東

Hao

YC

SOL

Supplement / Discussion

東

Hao

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/solutions/1735550/python-javascript-easy-solution-with-very-clear-explanation/

  1. 直覺會覺得使用左右指針來做，left 找最小值，right 找最大值
  2. 更新的邏輯
    1. Fix left
      1. Right > left => update maxProfit
      2. Right < left => left = right
    2. Loop ends when right < prices.length

YC

SOL

Last changed by 
 
哩扣寶寶船
0
76

Read more

#2 [Leetcode.21](https://leetcode.com/problems/merge-two-sorted-lists/) Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Feb 2, 2025
Merging Linked Lists

You&#39;re given two Linked Lists of potentially unequal length. These Linked Lists potentially merge at a shared intersection node. Write a function that returns the intersection node or returns None / null if there is no intersection.Each LinkedList node has an integer value as well as a next node pointing to the next node in the list or to None null if it&#39;s the tail of the list.Note: Your function should return an existing node. It should not modify either Linked List, and it should not create any new Linked Lists.

Feb 2, 2025
Remove Kth Node From End

Write a function that takes in the head of a Singly Linked List and an integer k and removes the kth node from the end of the list.The removal should be done in place, meaning that the original data structure should be mutated (no new structure should be created).Furthermore, the input head of the linked list should remain the head of the linked list after the removal is done, even if the head is the node that&#39;s supposed to be removed. In other words, if the head is the node that&#39;s supposed to be removed, your function should simply mutate its value and next pointer.Note that your function doesn&#39;t need to return anything.You can assume that the input Linked List will always have at least two nodes and, more specifically, at least k nodes.Each LinkedList node has an integer value as well as a next node pointing to the next node in the list or to None / null if it&#39;s the tail of the list.

Feb 2, 2025
11. Container With Most Water

https://leetcode.com/problems/container-with-most-water/solutions/3493276/c-java-python-javascript-optimized-code-easy-to-understand-100-solution-explained/

Aug 22, 2023
Read more from 哩扣寶寶船
Published on HackMD