全部內容
由新到舊
核心概念
使用二分搜搭配 BFS。
利用二分搜天數，找到 "The last day where we can still cross"。當二分搜到的該天還有路可以走則繼續往後面的天數二分搜，若沒路可以走則往前面的天數二分搜。
舉個例子，假如是 3*3 的矩陣，會有九天需要確認。第一次檢查第五
Description
Given an m x n binary matrix mat, return the number of submatrices that have all ones.
給定一個 m x n 二進位矩陣 mat ，傳回全為 1 的子矩陣的數量。
Solution
5/5LeetCode
Description
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of thei
前言
為了完成 LeetCode 題目 2. Add Two Numbers，我特地學習了 Python 中的 Linked List。不過我花了大約一小時的時間翻閱中英文影片及文章，卻始終找不到滿意的解說。
於是，我請 AI 當我的老師，生成了一篇 Python Linked List 教學。
5/5LeetCode
Soup Servings - LeetCode
Description
You have two soups, A and B, each starting with n mL. On every turn, one of the following four serving operatio
5/5LeetCode
早上 -- nini
資源分享：
pwn.college
學習 – HACK-A-SAT --- Learn – HACK-A-SAT
亞洲網路安全挑戰賽 --- Asian Cyber Security Challenge
NiNi's Den | NiNi's Den. CyberSe
將水果放入籃子 - LeetCode --- Fruit Into Baskets - LeetCode
Description
You are visiting a farm that has a single row of fruit trees arranged from......
Given an integer numRows, return the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly.....
5/5leetcode
information
link：Two Sum - LeetCode
Description：Given an array of integers nums and an integer target, return indices of the two numbers such......
5/5leetcode
