位运算-Single Number II（给定一个数组，除了一个数字出现一次，其他都出现三次，求出现一次的数）
题目描述：Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it
