原文題目
Given an integer array nums and an integer k, return the k most frequent el...
解題程式碼
var isSubtree = function (root, subRoot) {
const isSameTree = (p, q) =&g...
解題程式碼
var characterReplacement = function(s, k) {
let maxLength = 1;
let...
今天我們來解一道 LeetCode 的經典題目:Longest Substring Without Repeating Characters。這道題目考驗字串處...
題目 876:「鏈結串列的中間節點 (Middle of the Linked List)」要求我們找出單向鏈結串列的中間節點。如果有兩個中間節點,則回傳第二個...
Problem :
You are given an array prices where prices[i] is the price of a given...