add: description

2201/220116.cpp

@@ -1,6 +1,14 @@
 #include <iostream>
 #include <vector>
 
+/**
+ * 849. Maximize Distance to Closest Person
+ * You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty (0-indexed).
+ * There is at least one empty seat, and at least one person sitting.
+ * Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized.
+ * Return that maximum distance to the closest person.
+ */
+
 class Solution {
 public:
 	static int maxDistToClosest(const std::vector<int>& seats) {