93.复原IP地址
题目:93. 复原 IP 地址 - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
分割回文串的变体;
实际写的时候踩了无数细节上的坑,谁能想到sb只能传入str来创建新的实例呢
soluion
public class Solution {
public List<string> results = new List<string>();
public IList<string> RestoreIpAddresses(string s) {
StringBuilder path = new StringBuilder();
StringBuilder sb = new StringBuilder(s);
addressTraversal(sb, 0, path, 0);
return results;
}
public void addressTraversal(StringBuilder sb, int start, StringBuilder path, int count)
{
if(start >= sb.Length)
{
if(count == 4)
{
path.Remove(path.Length - 1, 1);
results.Add(path.ToString());
return;
}
return;
}
else
{
if(count>= 4) return;
}
StringBuilder subsb = new StringBuilder();
int bound = sb.Length < start + 3 ? sb.Length : start + 3;
for(int i = start; i < bound; i ++)
{
subsb.Append(sb[i]);
string substr = subsb.ToString();
if(isCorrect(substr))
{
StringBuilder temp = new StringBuilder(path.ToString());
path.Append(subsb);
path.Append('.');
count ++;
addressTraversal(sb, i + 1, path, count);
path = temp;
count --;
}
}
}
public bool isCorrect(string sb)
{
if(int.Parse(sb) == 0 && sb.Length == 1) return true;
if(sb[0] != '0' && int.Parse(sb) <= 255) return true;
return false;
}
}
summary
啊好多细节
1、递归终止条件
遍历到结尾且字串个数为4,得到有效地址,不为4结束递归
子串个数已经为4了但还没有遍历到结尾,结束递归
2、判断子串是否有效
当子串为0时,应当同时判断子串长度为1,“00”,“000”转换为整数也是0.。。。
3、将字串加入地址
如果写成如下,那么subsb也是需要回溯的
path.Append(subsb.Append('.'));
4、地址的回溯
c#中sb是引用类型,不可以用赋值语句进行拷贝,如下写法是错误的
StringBuilder temp = path;
path.Append(subsb);
path.Append('.');
count ++;
addressTraversal(sb, i + 1, path, count);
path = temp;
count --;
78.子集
题目:78. 子集 - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
soluion
public class Solution {
public List<IList<int>> results = new List<IList<int>>();
public IList<IList<int>> Subsets(int[] nums) {
List<int> result = new List<int>();
substsTraversal(nums, 0, result);
results.Add(new List<int>());
return results;
}
public void substsTraversal(int[] nums, int start, List<int> result)
{
if(start >= nums.Length) return;
for(int i = start; i < nums.Length; i ++)
{
result.Add(nums[i]);
results.Add(new List<int>(result));
substsTraversal(nums, i + 1, result);
result.RemoveAt(result.Count - 1);
}
}
}
summary
空集也是子集
90.子集Ⅱ
题目:90. 子集 II - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
子集+去重,想直接复制粘贴了
soluion
public class Solution {
public List<IList<int>> results = new List<IList<int>>();
public IList<IList<int>> SubsetsWithDup(int[] nums) {
List<int> result = new List<int>();
Array.Sort(nums);
substsTraversal(nums, 0, result);
results.Add(new List<int>());
return results;
}
public void substsTraversal(int[] nums, int start, List<int> result)
{
if(start >= nums.Length) return;
for(int i = start; i < nums.Length; i ++)
{
if(i > start && nums[i] == nums[i - 1]) continue;
result.Add(nums[i]);
results.Add(new List<int>(result));
substsTraversal(nums, i + 1, result);
result.RemoveAt(result.Count - 1);
}
}
}
summary
记得先排序