题目传送:https://leetcode.cn/problems/single-number-ii/
运行效率:
代码如下:
class Solution {public int singleNumber(int[] nums) { // 直接根据公式来 int((3*sum(set(nums))-sum(nums))/2) HashSet<Integer> set = new HashSet<>(); //用long类型的意义是为了避免数溢出 long sumOfSet=0; long total = 0; for(int i:nums){ if (set.add(i)){ sumOfSet+=i; } total+=i; } return (int)((3*sumOfSet-total)/2); }}
确定删除《Leetcode137. 只出现一次的数字 II》吗
暂无评论
2023-11-02
2024-05-08
2024-05-02
2024-04-30
2024-04-29
2024-04-26
2024-04-25
2024-04-24
2024-04-22