Leetcode Missing Number
来源：互联网 发布：linux高级运维 编辑：程序博客网 时间：2024/06/06 04:05
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?
Difficulty: Medium
public class Solution { public int missingNumber(int[] nums) { int sum = nums.length * (nums.length + 1) / 2; int curr_sum = 0; for(int i = 0; i < nums.length; i++){ curr_sum += nums[i]; } return sum - curr_sum; }} 0 0
- 【LeetCode】268 Missing Number
- [leetcode] 268.Missing Number
- [leetcode][math] Missing Number
- [LeetCode] Missing Number
- Leetcode -- Missing Number
- 【leetCode】Missing Number
- [Leetcode]Missing Number
- leetcode Missing Number
- 【leetcode】268. Missing Number
- [leetcode] Missing Number
- LeetCode(268)Missing Number
- Leetcode: Missing Number
- LeetCode之Missing Number
- LeetCode Missing Number
- [leetcode 268]Missing Number
- leetcode--Missing Number
- leetCode #286 Missing Number
- Leetcode 286 : Missing Number
- Leetcode Sum of Two Integers
- Leetcode Minimum Depth of Binary Tree
- Leetcode Word Ladder II
- Leetcode Binary Tree Preorder Traversal
- Leetcode Convert Sorted Array to Binary Search Tree
- Leetcode Missing Number
- Leetcode Fraction to Recurring Decimal
- Leetcode Rotate List
- typhon例子：cs，bufDataset(类似delphi的clientDataset)，josn解析器
- java反射覆写toString方法实现输出实体类属性值
- 动态加载碎片的简单用法
- vbox复制虚拟机的网络配置
- 全息投影
- KMP字符串模式匹配详解
