Update readme.md

Author: javadev

src/main/java/g0201_0300/s0232_implement_queue_using_stacks/readme.md

@@ -18,7 +18,10 @@ Implement the `MyQueue` class:
 
 **Example 1:**
 
-**Input** \["MyQueue", "push", "push", "peek", "pop", "empty"\] \[\[\], \[1\], \[2\], \[\], \[\], \[\]\]
+**Input:**
+
+    ["MyQueue", "push", "push", "peek", "pop", "empty"\]
+    [[], [1], [2], [], [], []]
 
 **Output:** \[null, null, null, 1, 1, false\]
 
@@ -37,4 +40,4 @@ Implement the `MyQueue` class:
 *   At most `100` calls will be made to `push`, `pop`, `peek`, and `empty`.
 *   All the calls to `pop` and `peek` are valid.
 
-**Follow-up:** Can you implement the queue such that each operation is **[amortized](https://en.wikipedia.org/wiki/Amortized_analysis)** `O(1)` time complexity? In other words, performing `n` operations will take overall `O(n)` time even if one of those operations may take longer.
+**Follow-up:** Can you implement the queue such that each operation is **[amortized](https://en.wikipedia.org/wiki/Amortized_analysis)** `O(1)` time complexity? In other words, performing `n` operations will take overall `O(n)` time even if one of those operations may take longer.