Skip to content

Commit f7a2ebf

Browse files
committed
8 problems solved.
1 parent 6a8b705 commit f7a2ebf

File tree

8 files changed

+126
-0
lines changed

8 files changed

+126
-0
lines changed

src/2639.cpp

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
vector<int> findColumnWidth(vector<vector<int>>& grid) {
2+
int row = grid.size();
3+
int col = grid[0].size();
4+
5+
vector<int> res(col, 0);
6+
for (int i = 0; i < col; ++i)
7+
{
8+
int maxlen = 0;
9+
for (int j = 0; j < row; ++j)
10+
{
11+
int n = 1;
12+
if (grid[j][i] != 0)
13+
{
14+
n = log10(abs(grid[j][i]))+1;
15+
if (grid[j][i] < 0)
16+
++n;
17+
}
18+
if (n > maxlen)
19+
maxlen = n;
20+
}
21+
22+
res[i] = maxlen;
23+
}
24+
25+
return res;
26+
}

src/2643.cpp

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
vector<int> rowAndMaximumOnes(vector<vector<int>>& mat) {
2+
int row = mat.size();
3+
int col = mat[0].size();
4+
5+
vector<int> res(2, 0);
6+
for (int r = 0; r < row; ++r)
7+
{
8+
int ct = 0;
9+
for (int c = 0; c < col; ++c)
10+
{
11+
if (mat[r][c] == 1)
12+
++ct;
13+
}
14+
if (ct > res[1])
15+
{
16+
res[0] = r;
17+
res[1] = ct;
18+
}
19+
}
20+
21+
return res;
22+
}

src/2651.cpp

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
int findDelayedArrivalTime(int arrivalTime, int delayedTime) {
2+
return (arrivalTime + delayedTime) % 24;
3+
}

src/2652.cpp

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
int sumOfMultiples(int n) {
2+
const int arr[7] = {n/3, n/5, n/7, n/15, n/21, n/35, n/105};
3+
int sum1 = 3*arr[0] + arr[0]*(arr[0]-1)*3/2;
4+
int sum2 = 5*arr[1] + arr[1]*(arr[1]-1)*5/2;
5+
int sum3 = 7*arr[2] + arr[2]*(arr[2]-1)*7/2;
6+
int sum4 = 15*arr[3] + arr[3]*(arr[3]-1)*15/2;
7+
int sum5 = 21*arr[4] + arr[4]*(arr[4]-1)*21/2;
8+
int sum6 = 35*arr[5] + arr[5]*(arr[5]-1)*35/2;
9+
int sum7 = 105*arr[6] + arr[6]*(arr[6]-1)*105/2;
10+
11+
return sum1+sum2+sum3-sum4-sum5-sum6+sum7;
12+
}

src/2678.cpp

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

src/2706.cpp

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
int buyChoco(vector<int>& prices, int money) {
2+
int minprice1 = 101;
3+
int minprice2 = 101;
4+
int len = prices.size();
5+
6+
for (int i = 0; i < len; ++i)
7+
{
8+
if (minprice1 == 101)
9+
{
10+
if (prices[i] < minprice1)
11+
minprice1 = prices[i];
12+
}
13+
else if (prices[i] < minprice1)
14+
{
15+
minprice2 = minprice1;
16+
minprice1 = prices[i];
17+
}
18+
else if (prices[i] < minprice2)
19+
{
20+
minprice2 = prices[i];
21+
}
22+
}
23+
24+
if (minprice1 + minprice2 <= money)
25+
return money - minprice1 - minprice2;
26+
else
27+
return money;
28+
}

src/2710.cpp

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
string removeTrailingZeros(string num) {
2+
int len = num.size();
3+
int i;
4+
for (i = len-1; i >= 0; --i)
5+
{
6+
if (num[i] != '0')
7+
break;
8+
}
9+
10+
return num.substr(0, i+1);
11+
}

src/2716.cpp

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
int minimizedStringLength(string s) {
2+
char arr[26] = {0};
3+
int len = s.size();
4+
int ct = 0;
5+
for (int i = 0; i < len; ++i)
6+
{
7+
arr[s[i]-'a']++;
8+
if (arr[s[i]-'a'] == 1)
9+
++ct;
10+
}
11+
12+
return ct;
13+
}

0 commit comments

Comments
 (0)