Array Partition

Given an array, find partitions such that each partition denotes a range of consecutive integers.

---

Note: The input array consists of sorted integers without duplicates.

---

Example:

Input : {1,2,3,6,7,8,10,11}  
Output : [1-3, 6-8, 10-11]