刷题总结#3

# 382
一个listnode列表，等可能地获得一个数，通过遍历实现
假设有n个,每个概率为1/n，但是遍历的时候遍历到k(k < n)，第k个概率为1/k，【不选中k后一个的概率为k/n】，所以最后算选到k的概率还是1/n。
int getRandom() {
int res = head->val;
ListNode* node = head->next;
int i = 2;
while(node){
int j = rand()%i;
if(j==0)
res = node->val;
i++;
node = node->next;
}
return res;
}

#343
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.
把一个数分解为2个以上的数的和，计算这些数的乘积最大值。
任何一个4以上的数，只要分解，一定是乘积比本身大。那么我们就需求计算多少个2，多少个3. 3的乘积越多越好。
if(n == 2)
return 1;
else if(n == 3)
return 2;
else if(n%3 == 0)
return (int)Math.pow(3, n/3);
else if(n%3 == 1)
return 2 * 2 * (int) Math.pow(3, (n - 4) / 3);
else
return 2 * (int) Math.pow(3, n/3);
我把这个题想成了一个DP。
ans[2]=1;ans[3]=2;ans[4]=4;
for(int i=5;i<=n;i++)
{
ans[i]=max(2*max(ans[i-2],i-2),3*max(ans[i-3],i-3));
}
return ans[n];

#454
Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.

To make problem a bit easier, all A, B, C, D have same length of N where 0 ≤ N ≤ 500. All integers are in the range of -228 to 228 - 1 and the result is guaranteed to be at most 231 - 1.

这种找相加等于0的题，可以用map来减维 ，变成一个N*N的问题
for(int i=0 ; i < n;i++)
{
for(int j=0;j < n;j++)
{
pq1[A[i]+B[j]]++;
pq2[C[i]+D[j]]++;
}
}
for(auto &it :pq1)
{
ans+=it.second*pq2[-it.first];
}

#539
给出clockpoints， 计算任意两个时间点的最少差距minute
string 转int 用stoi
int timeDiff(string t1, string t2) {
int h1 = stoi(t1.substr(0, 2));
int m1 = stoi(t1.substr(3, 2));
int h2 = stoi(t2.substr(0, 2));
int m2 = stoi(t2.substr(3, 2));
return (h2 - h1) * 60 + (m2 - m1);
}
计算时间差的时候，
方法一： int diff = abs(timeDiff(times[(i - 1 + n) % n], times[i]));
diff = min(diff, 1440 - diff);
mindiff = min(mindiff, diff);
方法二： 每个数都先加上24小时，再sort，这样会增加时间复杂度。
vector < pair< int,int > >clocks;
for(int i=0;i < timePoints.size();i++)
{
int shi,fen;
shi=(timePoints[i][0]-‘0’)*10+timePoints[i][1]-‘0’;
fen=(timePoints[i][3]-‘0’)*10+timePoints[i][4]-‘0’;
clocks.push_back(make_pair(shi,fen));
clocks.push_back(make_pair(shi+24,fen));
}
sort(clocks.begin(),clocks.end());
int ans=INT_MAX;
for(int i=1;i < clocks.size();i++)
{
int diff;
diff=(clocks[i].first-clocks[i-1].first)*60+(clocks[i].second-clocks[i-1].second);
ans=min(ans,diff);
}
return ans;