Two small issues

* A more concise version for  [2.1.2 Remove Duplicates from Sorted Array II]

  The thought is copied from your solution for [2.1.1 Remove Duplicates from Sorted Array].

* The complexity time for [2.1.4 Search in Rotated Sorted Array II]

  I think it is O(n) with regard to your solution.

  e.g. Search number 2 in array [1, 1 , 1, 1, 1 , 1, 1, 1, 1, 1 ...], it will search n/2 times.