LeetCode 260 -Single Number III ( JAVA )
来源:互联网 发布:ubuntu 查看硬盘 编辑:程序博客网 时间:2024/06/06 07:08
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]
.
Note:
- The order of the result is not important. So in the above example,
[5, 3]
is also correct. - Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
import java.util.*;public class Solution { public int[] singleNumber(int[] nums) { Arrays.sort(nums); int array[] = new int[2]; int count=0; for(int i=0;i<nums.length-1;i+=2){ if(nums[i]!=nums[i+1]){ array[count++]=nums[i]; i-=1; } } if(count==1){ array[1]=nums[nums.length-1]; } return array; }}
0 0
- LeetCode 260 -Single Number III ( JAVA )
- leetCode #260 Single Number III
- LeetCode(260)Single Number III
- [leetcode 260]Single Number III
- Leetcode #260 Single Number III
- [LeetCode 260] Single Number III
- leetcode: (260) Single Number III
- leetcode 260 : Single Number III
- LeetCode 260 Single Number III
- 【LEETCODE】260-Single Number III
- [leetcode 260] Single Number III
- LeetCode 260:Single Number III
- LeetCode #260 Single Number III
- LeetCode 260 Single Number III
- 【LeetCode-260】Single Number III
- LeetCode[260]Single Number III
- Leetcode 260 - Single Number III
- LeetCode-260:Single Number III
- 结构体内存对齐问题
- Atitit.判断元素是否显示隐藏在父元素 overflow
- Android 上多方式定位元素(python)
- Android中禁止Gridview上下滑动
- 南阳题目6-喷水装置(一)
- LeetCode 260 -Single Number III ( JAVA )
- volatile关键字
- Atitit.有分区情况下的表查询策略流程
- The type javax.servlet.http.HttpServletRequest cannot be resolved.
- java 富文本编辑内容去除格式 正则表达式
- opencv轮廓检测之椭圆检测-----算法篇(5)---LAPLACIAN算子
- 使用命令编译为jar包
- springMVC环境搭建
- android crash log 分析[精确地址查询]