8. 字符串转换整数 (atoi)
class Solution {
public:
int myAtoi(string s) {
int k = 0;
while (k < s.size() && s[k] == ' ') k++;
if (k == s.size()) return 0;
int flag = 1;
if (s[k] == '-')
{
flag = -1;
k++;
}
else if (s[k] == '+')
{
k++;
}
long long res = 0;
while (k < s.size() && s[k] >= '0' && s[k] <= '9')
{
res = res * 10 + s[k] - '0';
k++;
if (res > INT_MAX) break;
}
res *= flag;
if (res > INT_MAX) return INT_MAX;
if (res < INT_MIN) return INT_MIN;
return res;
}
};
221. 最大正方形
class Solution {
public:
int maximalSquare(vector<vector<char>>& matrix) {
int res = 0;
int m = matrix.size();
int n = matrix[0].size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
if (matrix[i - 1][j-1] == '1')
{
dp[i][j] = min(dp[i - 1][j - 1], min(dp[i][j - 1], dp[i - 1][j])) + 1;
res = max(res, dp[i][j]);
}
}
}
return res * res;
}
};
300. 最长递增子序列
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if (nums.size() <= 1)
{
return nums.size();
}
vector<int> dp(nums.size(), 1);
int res = 0;
for (int i = 1; i < nums.size(); i++)
{
for (int j = 0; j < i; j++)
{
if (nums[i] > nums[j])
{
dp[i] = max(dp[i], dp[j] + 1);
}
}
res = max(dp[i], res);
}
return res;
}
};