diff options
| author | crupest <crupest@outlook.com> | 2020-08-01 17:01:09 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2020-08-01 17:01:09 +0800 |
| commit | 979062297ebd0439929edd4e8d38ef1a62c1d201 (patch) | |
| tree | 355cc6c92d76bc75b7d863f79830b238efbd7fb8 | |
| parent | 20eebd4b087d402ae21fe2a499a5582bc72a8834 (diff) | |
| download | crupest-979062297ebd0439929edd4e8d38ef1a62c1d201.tar.gz crupest-979062297ebd0439929edd4e8d38ef1a62c1d201.tar.bz2 crupest-979062297ebd0439929edd4e8d38ef1a62c1d201.zip | |
import(solutions): Add problem que-shi-de-shu-zi-lcof .
| -rw-r--r-- | works/solutions/cpp/que-shi-de-shu-zi-lcof.cpp | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/works/solutions/cpp/que-shi-de-shu-zi-lcof.cpp b/works/solutions/cpp/que-shi-de-shu-zi-lcof.cpp new file mode 100644 index 0000000..1cb3e01 --- /dev/null +++ b/works/solutions/cpp/que-shi-de-shu-zi-lcof.cpp @@ -0,0 +1,29 @@ +#include <vector>
+
+using std::vector;
+
+class Solution
+{
+public:
+ int missingNumber(vector<int> &nums)
+ {
+ if (nums.back() == nums.size() - 1)
+ return nums.size();
+
+ int low = 0, high = nums.size() - 1;
+ while (low != high)
+ {
+ int middle = (low + high) / 2;
+ if (middle == nums[middle])
+ {
+ low = middle + 1;
+ }
+ else
+ {
+ high = middle;
+ }
+ }
+
+ return low;
+ }
+};
|