Missing Number
2015-09-08 10:38
405 查看
解题思路：利用输入漏掉数字的数组所有数字之和和完全数组之和，做减法，即差值即是所要的.
Java代码实现：
public class Solution {
public int missingNumber(int[] nums) {
int sum1=0;
int sum=0;
for(int i=0;i<nums.length+1;i++)
sum1=sum1+i;
for(int i=0;i<nums.length;i++)
sum=sum+nums[i];
return sum1-sum;
}
}
原题地址：https://leetcode.com/problems/missing-number/
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解
- LeetCode [Day 6] ZigZag Conversion 题解