add: 220121-CN

2201/220116-CN.cpp

@@ -5,5 +5,5 @@
  * Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.
  * Implement the Solution class:
  * Solution(ListNode head) Initializes the object with the integer array nums.
- * int getRandom() Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be choosen.
+ * int getRandom() Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be chosen.
  */

2201/220121-CN.cpp

@@ -0,0 +1,12 @@
+/**
+ * Refer: 220115.cpp
+ *
+ * 1345. Jump Game IV
+ * Given an array of integers arr, you are initially positioned at the first index of the array.
+ * In one step you can jump from index i to index:
+ * i + 1 where: i + 1 < arr.length.
+ * i - 1 where: i - 1 >= 0.
+ * j where: arr[i] == arr[j] and i != j.
+ * Return the minimum number of steps to reach the last index of the array.
+ * Notice that you can not jump outside of the array at any time.
+ */