1101 added.

liuyubobobo · liuyubobobo · commit fbdf39ff3e7a · 2019-07-07T19:23:03.000-07:00
diff --git a/1101-The-Earliest-Moment-When-Everyone-Become-Friends/cpp-1101/CMakeLists.txt b/1101-The-Earliest-Moment-When-Everyone-Become-Friends/cpp-1101/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.14)
+project(C)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(C main.cpp)
diff --git a/1101-The-Earliest-Moment-When-Everyone-Become-Friends/cpp-1101/main.cpp b/1101-The-Earliest-Moment-When-Everyone-Become-Friends/cpp-1101/main.cpp
@@ -0,0 +1,76 @@
+/// Source : https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/
+/// Author : liuyubobobo
+/// Time   : 2019-06-30
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Sorting + Union Find
+/// Time Complexity: O(nlogn + n * a(n))
+/// Space Complexity: O(n)
+class UF{
+
+private:
+    vector<int> parent;
+    int size;
+
+public:
+    UF(int n){
+        for(int i = 0 ; i < n ; i ++)
+            parent.push_back(i);
+        size = n;
+    }
+
+    int find(int p){
+        if( p != parent[p] )
+            parent[p] = find( parent[p] );
+        return parent[p];
+    }
+
+    bool isConnected(int p , int q){
+        return find(p) == find(q);
+    }
+
+    void unionElements(int p, int q){
+
+        int pRoot = find(p);
+        int qRoot = find(q);
+
+        if( pRoot == qRoot )
+            return;
+
+        parent[pRoot] = qRoot;
+        size --;
+    }
+
+    int sz(){
+        return size;
+    }
+};
+
+class Solution {
+public:
+    int earliestAcq(vector<vector<int>>& logs, int N) {
+
+        sort(logs.begin(), logs.end(),
+             [](const vector<int>& log1, const vector<int>& log2){
+           return log1[0] < log2[0];
+        });
+
+        UF uf(N);
+        for(const vector<int>& log: logs){
+            uf.unionElements(log[1], log[2]);
+            if(uf.sz() == 1) return log[0];
+        }
+        return -1;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -750,6 +750,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | | | | | | |
 | 1099 | [Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/) | [无] | [C++](1099-Two-Sum-Less-Than-K/cpp-1099/) | | |
 | 1100 | [Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/) | [无] | [C++](1100-Find-K-Length-Substrings-With-No-Repeated-Characters/cpp-1100/) | | |
+| 1101 | [The Earliest Moment When Everyone Become Friends](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/) | [无] | [C++](1101-The-Earliest-Moment-When-Everyone-Become-Friends/cpp-1101/) | | |
 | | | | | | |
 | 1103 | [Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | [solution](https://leetcode.com/problems/distribute-candies-to-people/solution/) | [C++](1103-Distribute-Candies-to-People/cpp-1103/) | | |
 | 1104 | [Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/) | [无] | [C++](1104-Path-In-Zigzag-Labelled-Binary-Tree/cpp-1104/) | | |
