Single Number III
来源:互联网 发布:js奇偶数判断的代码 编辑:程序博客网 时间:2024/05/22 06:54
Given an array of numbers nums
, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
For example:
Given nums = [1, 2, 1, 3, 2, 5]
, return [3, 5]
.
思路:
(1)题意为给定一个整数数组,其中有两个元素仅仅出现一次,其余所有的元素都出现两次,请找出这个两个只出现一次的元素。
(2)这里我用一个数组遍历一次得出结果,希望大家如果有更简单的方法,留言我哦
public static int[] SingleNumber(int[] intgers) {int[] result = new int[2];int u=0;int[] arrays=new int[256];for (int i = 0; i < intgers.length; i++) {int j = intgers[i];if(arrays[j]!=0) {arrays[j]+=1;result[u]=j;u++;}elsearrays[j]=1;}return result;}
阅读全文
0 0
- Single Number III
- Single Number III
- [LeetCode] Single Number III
- [leetcode] Single Number III
- 260 Single Number III
- [Leetcode]Single Number III
- [leetcode] Single Number III
- Leetcode: Single Number III
- 260 Single Number III
- LeetCode || Single Number III
- Single Number III
- Single Number III
- Single Number III
- [刷题]Single Number III
- Single Number III
- Leetcode75: Single Number III
- leetCode---Single Number III
- *LeetCode-Single Number III
- EasyDemo*常用API体系结构图(download pic Thx)
- codeforces-894C Marco and GCD Sequence
- 【Scikit-Learn 中文文档】优化估计器的超参数
- Tensorflow CIFAR-10训练例子报错解决
- 朴素贝叶斯分类Naive Bayesian
- Single Number III
- 引入Fresco 网络加载图片的学习
- 【Scikit-Learn 中文文档】模型评估: 量化预测的质量
- 如何快速且准确地运用搜索引擎查找资料
- http请求头详解
- LeetCode191 Number of 1 Bits
- Win10 Tensorflow(gpu) 安装详解
- 全球100款大数据工具汇总,入行必备
- Hadoop HDFS的运行原理