leetcode一些代码

一般过不了,只是为了练手

Find Minimum in Rotated Sorted Array 

int findMin(vector<int> &num)
{
	std::sort(num.begin(),num.end());
	return num[0];
}

Remove Duplicates from Sorted Array 

int removeDuplicates(int A[], int n) {
        int length = 0;
	for(int i=0;i<n-1;i++)
	{
		if(a[i]==a[i+1]) continue;
		else length++;
	}

	return length+1;
    }

Search Insert Position

int searchInsert(int a[],int n,int target)
{
	for(int i=0;i<n;i++)
	{
		if(a[i]==target || a[i]>target) return i;
		else if(a[i+1]>target) return i+1;
	}
	return n;
}

single number

int singleNumber(int a[],int n)
{
	int num = 0;
	for(int i=0;i<n;i++)
	{
		if(1==num) return a[i-1];
		for(int j=0;j<n;j++)
		{
			if(0==(a[i]^a[j]))
			{
				//cout<<"element is "<<a[i]<<endl;
				num++;
			}
			if(2==num)
			{
				num = 0;
				break;
			}
		}
	}
}

Sort Colors

void sortColors(int a[],int n)
{
	int red=0,white=0,blue=0;
	for(int i=0;i<n;i++)
	{
		if(0==a[i]) red++;
		else if(1==a[i]) white++;
		else blue++;
	}
	i = 0;
	while(red--) a[i++] = 0;
	while(white--) a[i++] = 1;
	while(blue--) a[i++] = 2;
}

length of last word

int lengthOfLastWord(const char *s) {
        int length = 0;
        char *s1;
        s1 = strref(s);
        for(int i=0;*(s1+i)!=' ';i++)
        {
            length++;       
        }
        
        return length;
}