LeetCode OJ--Search for a Range

http://oj.leetcode.com/problems/search-for-a-range/

要求复杂度为O(lgn)，用二分查找的思想。

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    void fun(int* A,int start,int end,int target,vector<int> &ans)
    {
        if(start>end || ( start == end && A[start]!= target ))
        {
            ans.push_back(-);
            ans.push_back(-);
            return;
        }
        if(start == end && A[start] == target)//只有一个元素了
        {
            ans.push_back(start);
            return;
        }
        if(A[start] == target && target ==A[end])
        {
            ans.push_back(start);
            ans.push_back(end);
            return;
        }
        int middle = (start + end)/;
        if(A[middle]<target)
            fun(A,middle+,end,target,ans);
        else if(A[middle]>target)
            fun(A,start,middle-,target,ans);
        else
        {
            ans.push_back(middle);
            return;
        }
        return;
    }
    vector<int> searchRange(int A[], int n, int target) {
        vector<int> ans;
        if(n == )
            return ans;

        fun(A,,n-,target,ans);

        int small,large;
        if(ans[] == -) //肯定没找到
        {
            ans.clear();
            ans.push_back(-);
            ans.push_back(-);
            return ans;
        }
        if(ans.size()==) //ans中只有一个元素
            small = large = ans[];

        if(ans.size() == )
        {
            small = ans[];
            large = ans[];
        }
        while(small>= && A[small] == target) //往左边扩展
            small--;
        while(large<=n- && A[large] == target) //往右边扩展
            large++;
        if(small == - || A[small]!=target) //考虑上面while循环的退出条件
            small++;
        if(large== n || A[large]!=target)
            large--;
        ans.resize(); //可能ans的size是1
        ans[] = small; //将扩展后的再赋值回来
        ans[] = large;
        return ans;
    }
};

int main()
{
    Solution myS;
    int A[] = {,,,,,,,};
    vector<int> ans = myS.searchRange(A,,);
    return ;
}