add: descriptions

cpp/2202/220223-CN.cpp

@@ -2,6 +2,14 @@
 #include <cctype>
 #include <iostream>
 
+/**
+ * 917. Reverse Only Letters
+ * Given a string s, reverse the string according to the following rules:
+ * All the characters that are not English letters remain in the same position.
+ * All the English letters (lowercase or uppercase) should be reversed.
+ * Return s after reversing it.
+ */
+
 class Solution {
 public:
 	static std::string reverseOnlyLetters(std::string s) {

cpp/2202/220223.cpp

@@ -15,6 +15,20 @@ public:
 };
 
 
+/**
+ * 133. Clone Graph
+ * Given a reference of a node in a connected undirected graph.
+ * Return a deep copy (clone) of the graph.
+ * Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.
+
+ * [ Definition of `Node` is shown above. ]
+
+ * Test case format:
+ * For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with val == 1, the second node with val == 2, and so on. The graph is represented in the test case using an adjacency list.
+ * An adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.
+ * The given node will always be the first node with val = 1. You must return the copy of the given node as a reference to the cloned graph.
+ */
+
 class Solution {
 public:
 	static Node* cloneGraph(const Node* const node) {