Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
could u please solve with dp?
from collections import deque class Solution: def countMaxOrSubsets(self, nums: List[int]) -> int: self.maximumOR = 0 for x in nums: self.maximumOR |= x self.res = [] self.currNums = deque() def helper(index,nums,currOR): if index == len(nums): if currOR == self.maximumOR: self.res.append(list(self.currNums)) return self.currNums.append(nums[index]) tempOR = currOR | nums[index] helper(index + 1, nums,tempOR) self.currNums.pop() helper(index + 1, nums,currOR) return currOR = 0 helper(0,nums,currOR) return len(self.res)
Bad explanation
could u please solve with dp?
from collections import deque
class Solution:
def countMaxOrSubsets(self, nums: List[int]) -> int:
self.maximumOR = 0
for x in nums:
self.maximumOR |= x
self.res = []
self.currNums = deque()
def helper(index,nums,currOR):
if index == len(nums):
if currOR == self.maximumOR:
self.res.append(list(self.currNums))
return
self.currNums.append(nums[index])
tempOR = currOR | nums[index]
helper(index + 1, nums,tempOR)
self.currNums.pop()
helper(index + 1, nums,currOR)
return
currOR = 0
helper(0,nums,currOR)
return len(self.res)
Bad explanation