Updated readme

Author: javadev

src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/readme.md

@@ -12,7 +12,15 @@ The first `k` elements of `nums` should contain the unique numbers in **sorted o
 
 The judge will test your solution with the following code:
 
-int[] nums = [...]; // Input array int[] expectedNums = [...]; // The expected answer with correct length int k = removeDuplicates(nums); // Calls your implementation assert k == expectedNums.length; for (int i = 0; i < k; i++) { assert nums[i] == expectedNums[i]; } 
+    int[] nums = [...]; // Input array
+    int[] expectedNums = [...]; // The expected answer with correct length
+
+    int k = removeDuplicates(nums); // Calls your implementation
+
+    assert k == expectedNums.length;
+    for (int i = 0; i < k; i++) {
+        assert nums[i] == expectedNums[i];
+    }
 
 If all assertions pass, then your solution will be **accepted**.
 
@@ -36,4 +44,4 @@ If all assertions pass, then your solution will be **accepted**.
 
 *   <code>1 <= nums.length <= 3 * 10<sup>4</sup></code>
 *   `-100 <= nums[i] <= 100`
-*   `nums` is sorted in **non-decreasing** order.
+*   `nums` is sorted in **non-decreasing** order.