Leecode精品文章

• 

  leecode 39 Combination Sum

  題目詳情 Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen f...

  yhaolpz 2019-08-15 14:15 評(píng)論0 收藏0
• 

  Leecode - 從數(shù)組中刪除重復(fù)項(xiàng)

  原文地址: https://www.luoyangfu.com/art... 題目 給定一個(gè)排序數(shù)組，你需要在原地刪除重復(fù)出現(xiàn)的元素，使得每個(gè)元素只出現(xiàn)一次，返回移除后數(shù)組的新長(zhǎng)度。 不要使用額外的數(shù)組空間，你必須在原地修改輸入數(shù)組并在使用 O(1) 額...

  kamushin233 2019-08-23 18:04 評(píng)論0 收藏0
• 

  [Leecode] Linked List Cycle 鏈表環(huán)

  Linked List Cycle I Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space? 快慢指針?lè)?復(fù)雜度 時(shí)間 O(N) 空間 O(1) 思路 這是一道非常經(jīng)典的雙指針題。我們從頭設(shè)置一個(gè)快指針，一個(gè)慢指針?？熘羔樢?..

  includecmath 2019-08-14 12:27 評(píng)論0 收藏0
• 

  Leecode-3 Longest Substring Without Repeating Char

  題目 Given a string, find the length of the longest substring without repeating characters. Example 1: Input: abcabcbbOutput: 3 Explanation: The answer is abc, with the length of 3. Example 2: Input: bb...

  luzhuqun 2019-08-16 13:49 評(píng)論0 收藏0
• 

  如何用位運(yùn)算實(shí)現(xiàn)整數(shù)的加減法

  今天刷Leecode刷到第371題： Sum of Two Integers Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. Credits: Special than...

  Worktile 2019-08-20 11:22 評(píng)論0 收藏0
• 

  web技術(shù)分享| LRU 緩存淘汰算法

  ...們運(yùn)用所掌握的數(shù)據(jù)結(jié)構(gòu)，設(shè)計(jì)和實(shí)現(xiàn)一個(gè)，或者參考 LeeCode 146 題。鏈表結(jié)點(diǎn) Entryexport class Entry { value: T key: string | number next: Entry prev: Entry constructor(val: T) { this.value = val; }}雙向鏈表 D...

  graf 2021-11-24 09:39 評(píng)論0 收藏0