55 lines
1.0 KiB
Python
55 lines
1.0 KiB
Python
from string import *
|
|
from re import *
|
|
from datetime import *
|
|
from collections import *
|
|
from heapq import *
|
|
from bisect import *
|
|
from copy import *
|
|
from math import *
|
|
from random import *
|
|
from statistics import *
|
|
from itertools import *
|
|
from functools import *
|
|
from operator import *
|
|
from io import *
|
|
from sys import *
|
|
from json import *
|
|
from builtins import *
|
|
import string
|
|
import re
|
|
import datetime
|
|
import collections
|
|
import heapq
|
|
import bisect
|
|
import copy
|
|
import math
|
|
import random
|
|
import statistics
|
|
import itertools
|
|
import functools
|
|
import operator
|
|
import io
|
|
import sys
|
|
import json
|
|
from typing import *
|
|
|
|
|
|
# @leet start
|
|
class Solution:
|
|
def productExceptSelf(self, nums: List[int]) -> List[int]:
|
|
arr = [1 for _ in range(len(nums))]
|
|
left_product = 1
|
|
for i in range(len(nums)):
|
|
arr[i] = left_product
|
|
left_product *= nums[i]
|
|
right_product = 1
|
|
for i in range(len(nums) - 1, -1, -1):
|
|
arr[i] = right_product * arr[i]
|
|
right_product *= nums[i]
|
|
|
|
return arr
|
|
|
|
|
|
# @leet end
|
|
|