【LeetCode】136 & 137 & 260 - Single Number I & II &III
I.
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Hide Similar Problems:
Solution : Xor
class Solution { public: int singleNumber(vector<int>& nums){ int ret=0; //it must be initialized for(int i=0;i<nums.size();i++){ ret=ret^nums[i]; } return ret; } };
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 without using extra memory?
Hide Similar Problems :
Solution :
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步