Leecode_Missing number
来源:互联网 发布:c语言程序的基本单位 编辑:程序博客网 时间:2024/05/22 15:16
The Problem:
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?
Right Solution: the sum of size+1 numbers - the sum of the array = the missing number
public class Solution {
public int missingNumber(int[] nums) {
int size = nums.length;
if(size < 1)
return 0;
else
{
int n1 = (size+1)*size/2;
int n2 = 0;
for(int i = 0; i<size; i++)
n2 = n2+nums[i];
return n1-n2;
}
}
}
- Leecode_Missing number
- Number
- number
- number
- Number
- number
- number
- Number
- Number
- NUMBER
- Number
- Number()
- number
- Number
- Number
- E: number number number
- 1005 number number number
- HDU6198 number number number
- 安卓命令写入图片,微信相册中拿不到
- 【小熊刷题】Validate Binary Search Tree <含recursion>
- 【cocos2d-x 3.7 飞机大战】 决战南海I (十一) 关于游戏场景
- 【cocos2d-x 3.7 飞机大战】 决战南海I (十二) 游戏结束场景
- 【cocos2d-x 3.7 飞机大战】 决战南海I (十三) 分数场景
- Leecode_Missing number
- Leetcode: Flatten Binary Tree to Linked List
- POJ 3645 解题报告
- 【LeetCode-面试算法经典-Java实现】【198-House Robber(抢劫犯)】
- Spring MVC MultiActionController example
- 【LeetCode-面试算法经典-Java实现】【199-Binary Tree Right Side View(从右边看二叉树)】
- Spring MVC MultiActionController annotation example
- 【LeetCode-面试算法经典-Java实现】【200-Number of Islands(岛的数目)】
- Spring MVC PropertiesMethodNameResolver example