本文共 2155 字，大约阅读时间需要 7 分钟。

1. how to calculate middle - arithmetic progression(mean)   M-S=T-M =>2M=S+T

2. while-loop or recursion: recursion will use system stack space, which should be avoided for simple problem. Recursion should be used for complex algorithm explanation.

3. when the while exit: start + 1 < end; which will exit the loop when there's only two or one elements left to divide.

4. avoid int overflow: start + (end-start)/2; python do not  have this issue.

5. how to handle duplicated values, when finding first/last position of the target

end = middle (finding first position) ; start = middle(finding last position)

6. how to implement it with recursion.

    when the recursive occurred: start+1 < end

   base case: start + 1 >= end

Adjective:

1. nearest in space or position; immediately adjoining without intervening space;

   "had adjacent rooms"

   "in the next room"
   "the person sitting next to me"
   "our rooms were side by side"

2. having a common boundary or edge; abutting; touching;

   "Rhode Island has two bordering states; Massachusetts and Conncecticut"

   "the side of Germany conterminous with France"
   "Utah and the contiguous state of Idaho"
   "neighboring cities"

3. near or close to but not necessarily touching;

   "lands adjacent to the mountains"

   "New York and adjacent cities"

1. The house adjacent to ours has been sold.
   与我们家邻接的房子已经售出。
2. His house is adjacent to mine.
   他的寓所与我的相毗连。
3. The planes landed on adjacent runways.
   这些飞机在毗连的跑道上降落。
4. The island of Cuba is adjacent to Florida.
   古巴岛接近佛罗里达。
5. The hospital is adjacent to a church.
   这家医院紧挨着一座教堂。

转载地址：http://tihbi.baihongyu.com/