본문 바로가기

아카이브

검색하기
아카이브
프로필사진 Rayi

  • 분류 전체보기 (226) N
    • CS (29) N
      • ML (3)
      • CV (2)
      • PS (24) N
    • Reveiw (8) N
      • Paper (8) N
      • Github (0)
    • Pytorch (5)
    • Language (55)
      • Python (6)
      • JavaScript (30)
      • TypeScript (16)
      • C++ (3)
    • IDE (12)
    • Git (13)
    • Frontend (25) N
      • React (8)
      • SolidJS (20)
      • CSS (8)
    • UI (3)
    • Backend (40)
      • DB (17)
      • Node.js (11)
Guestbook
Notice
Recent Posts
Recent Comments
Link
«   2025/04   »
일 월 화 수 목 금 토
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30
Tags
  • ML
  • vscode
  • js
  • html
  • Git
  • GAN
  • Linux
  • PyTorch
  • DB
  • nodejs
  • CSS
  • ts
  • sqlite
  • UI
  • CV
  • API
  • review
  • figma
  • Express
  • SOLID
  • PRISMA
  • opencv
  • postgresql
  • mongo
  • C++
  • frontend
  • Three
  • react
  • python
  • ps
more
Archives
Today
Total
관리 메뉴
  • 글쓰기
  • 방명록
  • RSS
  • 관리

목록2025/04/24 (1)

아카이브

[PS] Leet | 128. 가장 긴 연속 수

문제Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.You must write an algorithm that runs in O(n) time.예시Example 1:Input: nums = [100,4,200,1,3,2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. Example 2:Input: nums = [0,3,7,2,5,8,4,6,0,1] Output: 9Example 3:Input: nums = [1,0,1,..

CS/PS 2025. 4. 24. 13:31
이전 Prev 1 Next 다음

Blog is powered by kakao / Designed by Tistory
let textNodes = document.querySelectorAll("div.tt_article_useless_p_margin.contents_style > *:not(figure):not(pre)"); textNodes.forEach(function(a) { a.innerHTML = a.innerHTML.replace(/~(.*?)~/g, '$1'); });

티스토리툴바