leetcode

Daily Problem

2 files changed, 16 insertions(+), 0 deletions(-)

diff --git a/ Problems/0540.cpp b/ Problems/0540.cpp

@@ -0,0 +1,15 @@

class Solution {

public:

int singleNonDuplicate(vector<int> &nums) {

int low = 0, high = nums.size() - 1;

while (low < high) {

int mid = low + (high - low) / 2;

if ((mid % 2 == 0 && nums[mid] == nums[mid + 1]) ||

(mid % 2 == 1 && nums[mid] == nums[mid - 1]))

low = mid + 1;

else

high = mid;

}

return nums[low];

}

};

diff --git a/ README.md b/ README.md

@@ -252,6 +252,7 @@ for solving problems. | 0520 | Easy | [Detect Capital](Problems/0520.cpp) | | 0530 | Easy | [Minimum Absolute Difference in BST](Problems/0530.cpp) | | 0538 | Medium | [Convert BST to Greater Tree](Problems/0538.cpp) |

| 0540 | Medium | [Single Element in a Sorted Array](Problems/0540.cpp) |

| 0542 | Medium | [01 Matrix](Problems/0542.cpp) | | 0543 | Easy | [Diameter of Binary Tree](Problems/0543.cpp) | | 0547 | Medium | [Number of Provinces](Problems/0547.cpp) |