u014253011的博客

Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given “25525511135”, return [“255.255.11.135”, “255.255.111.35”]. (Order does...

原文链接：https://blog.youkuaiyun.com/chilseasai/article/details/50083201 题目链接：https://leetcode.com/problems/unique-binary-search-trees-ii/ 题目： Given n, generate all structurally un...

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s = “aab”, Return [ [“aa”,”b”]...

题目描述： 解题思路：图的遍历 #include<bits/stdc++.h> using namespace std; void dfs(vector<vector<int>>& v,int i, int j,int& n) { if (i<0 || i>=n ||

题目描述： 解题思路：图的遍历 #include<bits/stdc++.h> using namespace std; bool bfs(vector<vector<int>>& v, vector<bool>& test, int val) { queue&am