7734341542

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[[……]

(812) 782-1237

作业部分主要想写一下思路、code。想来一些只是点的总结也不见得有ppt完整,有时间单开总结简单写一写吧。

加载pdf放到page2里面了

第一题

第二题

第三题

总结什么的以后在写吧,先上代码,留个坑

第一问

int RotatedOrderedArray::rotatedK(const int *A, const int begin, const int end)
{
    if (A[begin] <= A[end]) return begin;
    int mid = (begin + end) / 2;
    if (A[mid] < A[begin[......]