refactor 239

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_239.java

@@ -8,7 +8,8 @@
  * Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right.
  * You can only see the k numbers in the window. Each time the sliding window moves right by one position.
 
- For example,
+ For example:
+
  Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.
 
  Window position                Max
@@ -28,7 +29,6 @@
  Could you solve it in linear time?
 
  Hint:
-
  How about using a data structure such as deque (double-ended queue)?
  The queue size need not be the same as the window’s size.
  Remove redundant elements and the queue should store only elements that need to be considered.