12/14-15

Author: eupho

Diff for: 217-contains-duplicate.cpp

@@ -0,0 +1,22 @@
+/*
+ * @lc app=leetcode.cn id=217 lang=cpp
+ *
+ * [217] 存在重复元素
+ */
+
+// @lc code=start
+class Solution {
+ public:
+  bool containsDuplicate(vector<int>& nums) {
+    set<int> s;
+    for (auto& n : nums) {
+      if (s.find(n) != s.end())
+        return true;
+      else {
+        s.insert(n);
+      }
+    }
+    return false;
+  }
+};
+// @lc code=end

Diff for: 274-h-index.cpp

@@ -0,0 +1,36 @@
+/*
+ * @lc app=leetcode.cn id=274 lang=cpp
+ *
+ * [274] H指数
+ */
+
+// @lc code=start
+class Solution {
+ public:
+  int hIndex(vector<int>& citations) {
+    // nums[n - x] >= h
+    // x <= h
+    // nums[n - x - 1] <= h
+    // mid = n - h;
+    // h = n - mid;
+    if (citations.empty()) return 0;
+    if (citations.size() == 1) {
+      return citations[0] >= 1;
+    }
+    sort(citations.begin(), citations.end());
+    int n = citations.size(), right = n - 1, left = 0;
+    int mid = 0, h = 0;
+    while (left <= right) {
+      mid = (left + right) >> 1;
+
+      if (citations[mid] >= n - mid) {
+        h = n - mid;
+        right = mid - 1;
+      } else {
+        left = mid + 1;
+      }
+    }
+    return h;
+  }
+};
+// @lc code=end