LeetCode898

题目大意
We have an array A of non-negative integers.

For every (contiguous) subarray B = [A[i], A[i+1], …, A[j]] (with i <= j), we take the bitwise OR of all the elements in B, obtaining a result A[i] | A[i+1] | … | A[j].

Return the number of possible results. (Results that occur more than once are only counted once in the final answer.)

Example 1:

Input: [0]
Output: 1
Explanation:
There is only one possible result: 0.
Example 2:

Input: [1,1,2]
Output: 3
Explanation:
The possible subarrays are [1], [1], [2], [1, 1], [1, 2], [1, 1, 2].
These yield the results 1, 1, 2, 1, 3, 3.
There are 3 unique values, so the answer is 3.
Example 3:

Input: [1,2,4]
Output: 6
Explanation:
The possible results are 1, 2, 3, 4, 6, and 7.

Note:

1 <= A.length <= 50000
0 <= A[i] <= 10^9

优化半天还是超时，还是看了别人的

class Solution {
    public int subarrayBitwiseORs(int[] A) {
		HashSet<Integer> fin = new HashSet<>();
		HashSet<Integer> cur = new HashSet<>();
		for (Integer i : A) {
            fin.add(i);
			HashSet<Integer> tem = new HashSet<>();
			tem.add(i);
			for (Integer j : cur) {
				tem.add(j| i);
				fin.add(j|i);
				//System.out.println(fin);
			}
			cur = tem;
			//System.out.println(cur);
		}
		return fin.size();
	}
}

贴我的超时的

class Solution {
    public int subarrayBitwiseORs(int[] A) {
   HashSet<Integer> fin = new HashSet<>();
		HashSet<Integer> cur = new HashSet<>();
		for (Integer i : A) {

			HashSet<Integer> tem = new HashSet<>();
			tem.add(i);
			for (Integer j : cur) {
				tem.add(j| i);
			}
			cur = tem;
			//System.out.println(cur);
			fin.addAll(cur);
			//System.out.println(fin);
		}
		return fin.size();
	}
}

class Solution {
    public int subarrayBitwiseORs(int[] A) {
     if(A.length<2) {
			return 1;
		}
		List<Integer> list=new ArrayList<>();
		list.add(A[0]);
		for(int i=1;i<A.length;i++) {
			if(!list.contains(A[i])) {
				list.add(A[i]);
			//	System.out.print(A[i]+",");
			}
			int tem=A[i];
			for(int j=i-1;j>=0;j--) {
				//System.out.println(tem+"|"+A[j]+"="+(tem|A[j]));
				tem=tem|A[j];
				if(!list.contains(tem)) {
					list.add(tem);
					//System.out.print(tem+",");
				}
			}
		}
		System.out.println(list);
		return list.size();
    }
}