Skip to content

Commit ac29fb9

Browse files
committed
5 problems solved.
1 parent 8711b58 commit ac29fb9

File tree

5 files changed

+87
-0
lines changed

5 files changed

+87
-0
lines changed

src/1455.cpp

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
int isPrefixOfWord(string sentence, string searchWord) {
2+
int len = sentence.size();
3+
int len2 = searchWord.size();
4+
int i = 0;
5+
int ct = 1;
6+
while (i < len)
7+
{
8+
int index = sentence.find(' ', i);
9+
if (index == string::npos)
10+
{
11+
if (len-i >= len2 && sentence.substr(i, len2) == searchWord)
12+
return ct;
13+
else
14+
break;
15+
}
16+
else
17+
{
18+
if (index-i >= len2 && sentence.substr(i, len2) == searchWord)
19+
return ct;
20+
else
21+
{
22+
i = index+1;
23+
++ct;
24+
}
25+
}
26+
}
27+
28+
return -1;
29+
}

src/1460.cpp

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
bool canBeEqual(vector<int>& target, vector<int>& arr) {
2+
int len = target.size();
3+
sort(target.begin(), target.end());
4+
sort(arr.begin(), arr.end());
5+
6+
for (int i = 0; i < len; ++i)
7+
{
8+
if (target[i] != arr[i])
9+
return false;
10+
}
11+
12+
return true;
13+
}

src/1464.cpp

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
int maxProduct(vector<int>& nums) {
2+
int len = nums.size();
3+
int arr[2] = {0,0};
4+
arr[0] = nums[0];
5+
arr[1] = nums[1];
6+
if (arr[0] < arr[1])
7+
swap(arr[0], arr[1]);
8+
for (int i = 2; i < len; ++i)
9+
{
10+
if (nums[i] > arr[1])
11+
{
12+
if (nums[i] > arr[0])
13+
{
14+
arr[1] = arr[0];
15+
arr[0] = nums[i];
16+
}
17+
else
18+
arr[1] = nums[i];
19+
}
20+
}
21+
22+
return (arr[0]-1)*(arr[1]-1);
23+
}

src/1480.cpp

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
vector<int> runningSum(vector<int>& nums) {
2+
int len = nums.size();
3+
vector<int> res(len);
4+
int sum = 0;
5+
for (int i = 0; i < len; ++i)
6+
{
7+
sum += nums[i];
8+
res[i] = sum;
9+
}
10+
11+
return res;
12+
}

src/1486.cpp

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
int xorOperation(int n, int start) {
2+
int res = 0;
3+
for (int i = 0; i < n; ++i)
4+
{
5+
int tmp = start + 2*i;
6+
res ^= tmp;
7+
}
8+
9+
return res;
10+
}

0 commit comments

Comments
 (0)