leetcode 237\238\292

237 删除链表中的节点

# 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.
        """
        node.val = node.next.val
        node.next = node.next.next

238 除自身以外数组的乘积

1	nums[1]	nums[2]	nums[3]
nums[0]	1	nums[2]	nums[3]
nums[0]	nums[1]	1	nums[3]
nums[0]	nums[1]	nums[2]	1

# 上三角，下三角法
class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        res = [1]
        p = 1
        q = 1
        for i in range(len(nums)-1):
            p *= nums[i]
            res.append(p)
        print(res)
        for j in range(len(nums)-1, 0,-1):
            q *= nums[j]
            res[j-1] *= q
        return res

292 Nim 游戏

# 数学问题，如果总数量为4的倍数，那么先手必输
class Solution:
    def canWinNim(self, n: int) -> bool:
        if n%4 == 0: return False
        return True