{"push_id":745204401,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"62f85840e4a91efe3a99f7d99a637492f25ea5fd","before":"5e5cafee4d3d4083f1164163bdec1bc76d3b262f","commits":[{"sha":"62f85840e4a91efe3a99f7d99a637492f25ea5fd","author":{"email":"9084128a60eb5b60503ef22a50c2f39e31d0dc78@nike.com","name":"Jian Shen"},"message":"#81 Search in Rotated Sorted Array II - duplicate values it does affect the results, when nums[mid] == nums[right] we cannot tell if right side is sorted or not. The solution is to keep remove duplicates in this case. And in the worst case with all duplicate values, the time complexity is O(N), but if duplicate values is not that much, the time complexity will still be close to O(logN).","distinct":true,"url":"https://api.github.com/repos/blueaken/JianTestPlayGround/commits/62f85840e4a91efe3a99f7d99a637492f25ea5fd"}]}