Count Number of Maximum Bitwise-OR Subsets | LeetCode Weekly contest 263 | DSA

Поделиться
HTML-код
  • Опубликовано: 24 окт 2024

Комментарии • 5

  • @rajgupta5158
    @rajgupta5158 3 года назад +1

    could u please solve with dp?

  • @kulasekhar
    @kulasekhar 3 года назад

    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)

  • @manannagpal2822
    @manannagpal2822 Месяц назад

    Bad explanation