Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once.
Example 1:
1
2
Input:[1,1,2,3,3,4,4,8,8]
Output:2
Example 2:
1
2
Input:[3,3,7,7,10,11,11]
Output:10
Note: Your solution should run in O(log n) time and O(1) space.
Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list that is larger than the given target.
Letters also wrap around. For example, if the target is target = 'z' and letters = ['a', 'b'], the answer is 'a'.
Examples:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
Input:
letters=["c","f","j"]
target="a"
Output:"c"
Input:
letters=["c","f","j"]
target="c"
Output:"f"
Input:
letters=["c","f","j"]
target="d"
Output:"f"
Input:
letters=["c","f","j"]
target="g"
Output:"j"
Input:
letters=["c","f","j"]
target="j"
Output:"c"
Input:
letters=["c","f","j"]
target="k"
Output:"c"
Note:
letters has a length in range [2, 10000].
letters consists of lowercase letters, and contains at least 2 unique letters.
Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.
Your class will have the method, book(int start, int end). Formally, this represents a booking on the half open interval [start, end), the range of real numbers x such that start <= x < end.
A double booking happens when two events have some non-empty intersection (ie., there is some time that is common to both events.)
For each call to the method MyCalendar.book, return true if the event can be added to the calendar successfully without causing a double booking. Otherwise, return false and do not add the event to the calendar.
Your class will be called like this: MyCalendar cal = new MyCalendar();MyCalendar.book(start, end)
Example 1:
1
2
3
4
5
6
7
MyCalendar();
MyCalendar.book(10,20);// returns true
MyCalendar.book(15,25);// returns false
MyCalendar.book(20,30);// returns true
Explanation:
The first event can be booked.The second can'tbecause time15isalready booked by another event.
The third event can be booked,asthe first event takes every time less than20,but notincluding20.
Note:
The number of calls to MyCalendar.book per test case will be at most 1000.
In calls to MyCalendar.book(start, end), start and end are integers in the range [0, 10^9].
Given an integer array, return the k-th smallest distance among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.