class Solution {
public:
long long NNAplusB(int a, int b) {
long long A = 0;
long long B = 0;
for(int i = 0 ; i < b; i ++)
{
A*=10;
A+=a;
}
for(int i = 0 ; i < a; i ++)
{
B*=10;
B+=b;
}
return A+B;
}
};
子序列可以不连续 子串要连续
class Solution {
public:
int NS_LIS(string n) {
int len = n.length();
int sum = 0;
for(int i = 0 ; i < len ; i++)
{
sum+=n[i]-'0';
}
return max(n[0]-'0'-1+9*(len-1),sum);
}
};
就是计算把数组中的每一位变成第i位的最少次数,如果暴力写只能通过50%(以下是我自己写的暴力代码)
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
vector<int> h = {3,1,4,5,3};
vector<int> re;
int time = 0;
for (int i = 0; i<h.size(); i++){
for (int j = 0; j<h.size(); j++){
if (h[j] - h[i]<0)time = time - (h[j] - h[i]);
else time = time + h[j] - h[i];
}
re.push_back(time);
time = 0;
}
system("pause");
return 0;
}
以下是标准答案
bool cmp(node a,node b)
{
return a.num<b.num;
}
class Solution {
public:
vector<int> Magical_NN(vector<int>& h) {
vector<node> arr;
int len = h.size();
for(int i = 0 ; i < len ; i++)
{
node t;
t.num = h[i];
t.i = i;
arr.push_back(t);
}
sort(arr.begin(),arr.end(),cmp);
vector<int> sum(len);//前缀和
sum[0] = arr[0].num;
long long SUM = arr[0].num;
for(int i = 1 ; i < len ; i++)
{
sum[i] = sum[i-1]+arr[i].num;
SUM+=arr[i].num;
}
vector<int> ans(len);
ans[arr[0].i] = (SUM-sum[0] - arr[0].num*(len-1));
for(int i = 1 ; i < len ; i++)
{
ans[arr[i].i] = (arr[i].num*(i)-sum[i-1]) + (SUM-sum[i] - arr[i].num*(len-i-1));
}
return ans;
}
};
(这个方法没听 有点看不懂)