【LeetCode】Single Number III
来源:互联网 发布:首届全球程序员节直播 编辑:程序博客网 时间:2024/06/07 15:58
题目
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?
代码
public class Solution { public int[] singleNumber(int[] nums) { int [] ans = new int[2]; Arrays.sort(nums); int pos = 0; if(nums.length == 2) { return nums; } for(int i = 0 ; i < nums.length - 1;i++) { if(nums[i] != nums[i+1]) { ans[pos++] = nums[i]; } else { i++; } } if(pos == 1) ans[1] = nums[nums.length -1]; return ans; }}
写的有点丑陋。。
0 0
- [LeetCode] Single Number III
- [leetcode] Single Number III
- [Leetcode]Single Number III
- [leetcode] Single Number III
- Leetcode: Single Number III
- LeetCode || Single Number III
- leetCode---Single Number III
- *LeetCode-Single Number III
- Single Number III -- leetcode
- Leetcode: Single Number III
- [LeetCode] Single Number III
- LeetCode--Single Number III
- leetcode-Single Number III
- LeetCode:Single Number III
- [LeetCode] Single Number III
- LeetCode -- Single Number III
- 【leetcode】Single Number III
- 【Leetcode】Single Number III
- sqlserver 自动备份执行脚本
- 使用WebApplicationContext 获取文件内容
- 巧用LoRa无线网络 实现工厂节能减排
- SSL/TLS 协议详解
- opencv 常见细碎问题解决
- 【LeetCode】Single Number III
- js获取服务端的头信息
- 文章标题
- SIP中的SDP offer/answer交换初探
- poj3026 Borg Maze (BFS+最小生成树)
- junit源码解析--测试驱动运行阶段
- C#成神之路<3> 开发程序计划
- 微信 url scheme协议大全
- CardView