[LeetCode - Daily Challenge] 994. Rotting Oranges

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing a fresh orange, or 2 representing a rotten orange. Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. Return the minimum number of minutes that must elapse until no cell has a fresh orange. If t..
Algorithm/LeetCode 2021. 10. 29. 21:14
[LeetCode - Daily Challenge] 15. 3Sum

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Example 1: Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Example 2: Input: nums = [] Output: [] Example 3: Input: nums = [0]..
Algorithm/LeetCode 2021. 10. 29. 04:52
1