-
今日学习的文章链接,或者视频链接
-
自己看到题目的第一想法
-
看完代码随想录之后的想法
93
class Solution {
public:
vector<string> result;
bool isvalid(string s,int start,int end){
if (start > end) {
return false;
}
if (s[start] == '0' && start != end) { // 0开头的数字不合法
return false;
}
int num = 0;
for (int i = start;i<=end;i++){
if (s[i] > '9' || s[i] < '0') { // 遇到非数字字符不合法
return false;
}
num = num * 10 + (s[i] - '0');
if (num > 255) { // 如果大于255了不合法
return false;
}
}
return true;
}
void backtracking(string s,int startIndex,int pointSum){
if(pointSum == 3){
if(isvalid(s,startIndex,s.size()-1)){
result.push_back(s);
return;
}
}
for (int i = startIndex;i<s.size();i++){
if (isvalid(s,startIndex,i)){
s.insert(s.begin()+i+1,'.');
pointSum+=1;
backtracking(s,i+2,pointSum);
s.erase(s.begin()+i+1);
pointSum-=1;
}
}
}
vector<string> restoreIpAddresses(string s) {
backtracking(s,0,0);
return result;
}
};
78
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums,int startIndex){
result.push_back(path);
if(startIndex>=nums.size()){
return;
}
for(int i = startIndex;i<nums.size();i++){
path.push_back(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
backtracking(nums,0);
return result;
}
};
90:
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums,int startIndex){
result.push_back(path);
for(int i =startIndex;i<nums.size();i++){
if(i>startIndex&&nums[i]==nums[i-1]){
continue;
}else{
path.push_back(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(),nums.end());
backtracking(nums,0);
return result;
}
};
-
自己实现过程中遇到哪些困难
-
今日收获,记录一下自己的学习时长