로그 남기기

  • 홈
  • 태그

leetcode 파이썬 2

[리트코드/Leetcode] 11 - Container With Most Water

11 - Container With Most Water 📌 문제 Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. 📋 코드 class Solution: def maxArea(self, height: List[..

Algorithm/📊 Problem Solving

[리트코드/Leetcode] 200 - Number of Islands

200 - Number of Islands 📌 문제 Given an m x n 2d grid map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. 📋 코드 class Solution: def numIslands(self, grid: List[List[str]]) -> int: def dfs(visited, i, j): stack =..

Algorithm/📊 Problem Solving
1
더보기
프로필사진

  • 💻 Development (408)
    • Algorithm (200)
      • 📝 Concept (10)
      • 📊 Problem Solving (190)
    • Computer Science (17)
      • 🔒 Operating System (11)
      • 📡 Network (3)
      • 💾 Database (3)
    • Back-end (18)
      • ⌛ Intro (5)
      • 🔩 Server program (5)
      • 📗 Spring (5)
      • 📒 Node.js (3)
    • Language (9)
      • 📕 Java (8)
      • 📘 Python (1)
    • Infra (13)
      • ⛅ AWS (3)
      • 📺 Git (10)
    • Retrospect (119)
      • 🥇 Daily (111)
      • 🥈 Weekly (6)
      • 🥉 Montly (2)
    • Etc (32)
      • 📢 Talk (11)
      • 📃 Certification (21)

최근글과 인기글

  • 최근글
  • 인기글

최근댓글

05-24 19:48

방문자수Total

  • Today :
  • Yesterday :
Github

Copyright © Kakao Corp. All rights reserved.

  • github

티스토리툴바