Problem : problem
Code :
code
. I want to know the time complexity of my algorithm. Although it runs within 16 ms on leetcode but is it really O(n) time and O(1) space??
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Estimate time complexity of randomized algorithm
Problem : problem
Code :
class Solution
{
public:
vector<int> majorityElement(vector<int>& nums)
{
srand(time(NULL));
int c=0,n=nums.size();
vector <int> ans;
while((n-c)>(n/3))
{
int i=rand()%n,f=0;
int x=nums[i];
for(int j=0;j<n&&x!=INT_MAX-1;j++)
{
if(nums[j]==x)
{
nums[j]=INT_MAX-1;
f++;
}
}
//cout<<x<<" "<<f<<" ";
if(f>(n/3))
ans.push_back(x);
c+=f;
}
return ans;
}};
. I want to know the time complexity of my algorithm. Although it runs within 16 ms on leetcode but is it really O(n) time and O(1) space??
| Name |
|---|


