(java)Missing Number
来源:互联网 发布:linux中文输入法有哪些 编辑:程序博客网 时间:2024/06/08 02:44
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n
, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3]
return 2
.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
思路:将1.....n加起来,然后减去nums[0].....nums[n-1]
代码如下(已通过leetcode)
publicint missingNumber(int[] nums) {
int len =nums.length;
int sum = (int)((len*(len+1))/2);
for(int i: nums)
sum-=i;
return sum;}
0 0
- (java)Missing Number
- 268. Missing Number(java)
- 268. Missing Number(Java)
- Missing Number Leetcode 268 Java
- LeetCode 268 -Missing Number ( JAVA )
- leetcode-java-268. Missing Number
- LeetCode-268. Missing Number (Java)
- 【LeetCode】268 Missing Number (java实现)
- leetcode:268. Missing Number(Java)解答
- 【Leetcode】:268. Missing Number 问题 in JAVA
- Missing number
- Missing number
- Missing number
- Missing number
- Missing Number
- Missing Number
- Missing Number
- Missing Number.
- javaScript引入方式
- atitit.MIZIAN 陕北方言 特有词汇 大词典 attilax 整理 h--n v1 q31.xlsx
- 微信公众号 “网络出错,轻触屏幕重新加载”
- 【数据结构与算法】六 █算法复杂度█ 二 时间复杂度 递归算法
- 292. Nim Game
- (java)Missing Number
- hbase
- Linux下使用C语言返回年月日
- 常用的数据结构
- 用队列写贪吃蛇(C语言版)
- 程序员的故事 008 编程语言之争
- MFC双缓冲绘图
- linux redis安装
- (java)Binary Tree Preorder Traversal