自我监督刷题记录处8
第8天,今天写每日一题写的很费劲,但是是一道简单题=-=。。一碰上graph我就蒙…每天看评论里的大神都觉得自己的智商收到了鄙视,但慢慢就习惯了,承认智商较低就好了O(∩_∩)O。。渐渐习惯智商受被侮辱…我好难啊。。头疼
Leetcode每日一题(994)Rotting Orange
(Easy Level)
class Solution:
def orangesRotting(self, grid: List[List[int]]) -> int:
x,y,time = len(grid),len(grid[0]),0
#橘子病毒散播方向坐标
locs,stack = [[-1,0],[0,-1],[0,1],[1,0]],[]
#筛查烂橘子,之后先放入堆
for i in range(x):
for j in range(y):
if grid[i][j] == 2:
stack.append((i,j,0))
#从头开始先pop出一个烂橘子,之后他周围的好橘子被传染,入堆,时间+1
while stack:
i,j,time = stack.pop(0)
for loc in locs:
loc_i,loc_j = i+loc[0],j+loc[1]
if 0 <=loc_i<x and 0<=loc_j<y and grid[loc_i][loc_j]==1:
grid[loc_i][loc_j] = 2
stack.append((loc_i,loc_j,time+1))
#筛查格子里是否还有好橘子,有则返回-1
for g in grid:
if 1 in g:
return -1
return time
Leetcode 237. Delete Node in a Linked List
(Easy Level)
写这道题的原因是因为我卡在头在哪这个问题上卡了半天,看了解析才明白什么意思。。。。固定思维很容易限定想象的空间,脑洞还是要无线放大才行,我今天脑子有点硬的感觉不知道为什么
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def deleteNode(self, node):
"""
:type node: ListNode
:rtype: void Do not return anything, modify node in-place instead.
"""
#直接赋值,不要纠结head在哪里。。。
node.val = node.next.val
node.next = node.next.next
感冒了。。。发布文章按成保存草稿了。。。。