Add Solution 035[CPP]

[KongJHong]

None.

[yanglbme]

mid = (left + right) / 2 这个写法并不好，可能发生溢出而导致程序错误。
最好写成 mid = left + ((right - left) >> 1) 噢~

[KongJHong]

了解 发件人: Libin Yang 发送时间: 2018年10月26日 20:17 收件人: doocs/leetcode 抄送: KongJHong; Author 主题: Re: [doocs/leetcode] Add Solution 035[CPP] (#61) @yanglbme commented on this pull request. In solution/035.Search Insert Position/README.md:

+ }

+ else{ + slow++; + fast++; + } + } + return fast; + } + } + + + int binarySearch(vector<int> &nums,int left,int right,int target){ + if(nums[left] == target)return left; + if(nums[right] == target)return right; + + int mid = (left + right) / 2; mid = (left + right) / 2 这个写法并不好，可能发生溢出而导致程序错误。 最好写成 mid = left + ((right - left) >> 1) 噢~ — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub, or mute the thread.