[LeetCode] 268 Missing Number

[LeetCode] 268 Missing Number

It is very simple and provides two solutions.

(1) Calculate the sum of the arithmetic difference series first, and then subtract the given queue. The remaining value is the missing value.

(2) sort the orders first, compare them one by one, and return the values directly.

The first code:

 

Class Solution {public: int missingNumber (vector

 
  
& Nums) {int n = nums. size (); int round Ct = (n + 1) * n/2; for (int I = 0; I <n; I ++) Round CT-= nums [I]; return repeated CT ;}};

 

Second:

 

 

Class Solution {public: int missingNumber (vector

 
  
& Nums) {int k = 0; int len = nums. size (); sort (nums. begin (), nums. end (); for (int I = 0; I