lee5's blog

By lee5, history, 6 months ago, In English

Can someone help me with this problem? Given an array of integers. Find the smallest positive integer which cannot be formed by performing bitwise OR on all the elements of a chosen subset. I don't know the range of n(size of the array), but what can be the most optimized approach?

Read more »

  • Vote: I like it
  • +10
  • Vote: I do not like it