丑数问题
/*************************************************************************
> File Name: UglyNumber.cpp
> Author: Shaojie Kang
> Mail: kangshaojie@ict.ac.cn
> Created Time: 2015年08月22日 星期六 07时53分35秒
> Problem:
Ugly number is a number that only have factors 3, 5 and 7.
Design an algorithm to find the Kth ugly number. The first 5 ugly numbers are 3, 5, 7, 9, 15 ...
Have you met this question in a real interview? Yes
Example
If K=4, return 9.
Challenge
O(K log K) or O(K) time.
> Solution:
just only generate the ugly numbers
************************************************************************/
#include<iostream>
#include<vector>
using namespace std;
long long kthPrimeNumber(int k)
{
vector<long long> uglyData(k+1);
uglyData[0] = 1;
int index3 = 0;
int index5 = 0;
int index7 = 0;
int currentIndex = 1;
while(currentIndex <= k)
{
long long temp = min(uglyData[index3] * 3, uglyData[index5] * 5);
uglyData[currentIndex] = min(temp, uglyData[index7] * 7);
while(uglyData[index3]*3 <= uglyData[currentIndex])
index3++;
while(uglyData[index5]*5 <= uglyData[currentIndex])
index5++;
while(uglyData[index7]*7 <= uglyData[currentIndex])
index7++;
currentIndex++;
}
return uglyData[k];
}
sort colors
/*************************************************************************
> File Name: SortColors.cpp
> Author: Shaojie Kang
> Mail: kangshaojie@ict.ac.cn
> Created Time: 2015年09月08日 星期二 16时26分39秒
> Problem:
Given an array with n objects colored red, white or blue, sort them so that objects of the same color
are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Have you met this question in a real interview? Yes
Example
Given [1, 0, 1, 2], return [0, 1, 1, 2].
Note
You are not suppose to use the library's sort function for this problem.
Challenge
A rather straight forward solution is a two-pass algorithm using counting sort. First, iterate the array
counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.
Could you come up with an one-pass algorithm using only constant space?
> Solution:
平移计数
************************************************************************/
#include<iostream>
#include<vector>
using namespace std;
void sortColors(vector<int> &nums)
{
int size = nums.size();
if(size <= 1) return;
int zeroPos = -1;
int onePos = -1;
int twoPos = -1;
for(int i = 0; i < size; ++i)
{
if(nums[i] == 0)
{
nums[++twoPos] = 2;
nums[++onePos] = 1;
nums[++zeroPos] = 0;
}
else if(nums[i] == 1)
{
nums[++twoPos] = 2;
nums[++onePos] = 1;
}
else nums[++twoPos] = 2;
}
}
void print(const vector<int> &nums)
{
for(int i = 0; i < nums.size(); ++i)
cout<<nums[i]<<" ";
cout<<endl;
}
int main()
{
int arr[] = {
1, 0, 1, 2
};
vector<int> nums(arr, arr + sizeof(arr)/sizeof(int));
sortColors(nums);
print(nums);
return 0;
}