DFS
文章平均质量分 69
张荣华_csdn
这个作者很懒,什么都没留下…
展开
-
Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically nei...原创 2018-06-12 09:26:18 · 178 阅读 · 0 评论 -
Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Note: A leaf is a node with no children.Example:...原创 2018-08-04 00:08:57 · 140 阅读 · 0 评论 -
Path Sum III
You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it mus...原创 2018-08-04 00:09:02 · 130 阅读 · 0 评论 -
迷宫问题
定义一个二维数组N*M(其中2<=N<=10;2<=M<=10),如5 × 5数组下所示: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一...原创 2018-08-09 11:37:27 · 365 阅读 · 2 评论 -
Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.A sudoku solution must satisfy all of the following rules:Each of the digits 1-9 must occur exactly once in each row. Each of t...原创 2018-08-09 11:37:44 · 170 阅读 · 0 评论 -
24点游戏算法
题目描述问题描述:给出4个1-10的数字,通过加减乘除,得到数字为24就算胜利输入:4个1-10的数字。[数字允许重复,但每个数字仅允许使用一次,测试用例保证无异常数字]输出:true or false输入描述:输入4个int整数输出描述:返回能否得到24点,能输出true,不能输出false#include <iostream>using names...原创 2018-08-14 10:34:44 · 1581 阅读 · 0 评论 -
Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Note:All numbers will ...原创 2018-08-05 00:22:49 · 135 阅读 · 0 评论 -
子数组和相等
题目描述编写一个函数,传入一个int型数组,返回该数组能否分成两组,使得两组中各元素加起来的和相等,并且,所有5的倍数必须在其中一个组中,所有3的倍数在另一个组中(不包括5的倍数),能满足以上条件,返回true;不满足时返回false。 输入描述:第一行是数据个数,第二行是输入的数据输出描述:返回true或者false#include <bits/stdc++.h&g...原创 2018-08-12 10:54:01 · 818 阅读 · 0 评论 -
39. 组合总和
给定一个无重复元素的数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。candidates 中的数字可以无限制重复被选取。说明:所有数字(包括 target)都是正整数。 解集不能包含重复的组合。 示例 1:输入: candidates = [2,3,6,7], target = 7,所求解集...原创 2018-08-22 15:46:39 · 222 阅读 · 0 评论 -
40. 组合总和 II
给定一个数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。candidates 中的每个数字在每个组合中只能使用一次。说明:所有数字(包括目标数)都是正整数。 解集不能包含重复的组合。 示例 1:输入: candidates = [10,1,2,7,6,1,5], target = 8,所求解集...原创 2018-08-22 15:49:34 · 214 阅读 · 0 评论 -
17. 电话号码的字母组合
给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。示例:输入:"23"输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].说明:尽管上原创 2018-08-18 11:18:19 · 184 阅读 · 0 评论 -
22. 括号生成
给出 n 代表生成括号的对数,请你写出一个函数,使其能够生成所有可能的并且有效的括号组合。例如,给出 n = 3,生成结果为:[ "((()))", "(()())", "(())()", "()(())", "()()()"]class Solution {public: void help(int left,int right,string out...原创 2018-08-18 11:19:02 · 295 阅读 · 0 评论 -
46. 全排列
给定一个没有重复数字的序列,返回其所有可能的全排列。示例:输入: [1,2,3]输出:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]class Solution {public: void findAll(vector<int>& nums,int begin,...原创 2018-09-02 20:29:12 · 104 阅读 · 0 评论 -
47. 全排列 II
给定一个可包含重复数字的序列,返回所有不重复的全排列。示例:输入: [1,1,2]输出:[ [1,1,2], [1,2,1], [2,1,1]]class Solution {public: vector<vector<int>> permuteUnique(vector<int>& nums) { ...原创 2018-09-02 20:31:46 · 244 阅读 · 0 评论 -
Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Note: A leaf is a node with no children.Example:Given the below binary tree and sum = 22,...原创 2018-08-04 00:08:38 · 140 阅读 · 0 评论 -
矩阵中的相邻数
题目:计算出与第二行第一列的元素5相邻的有几个5.相邻的相邻也算相邻元素。1 1 5 5 15 5 5 1 11 1 5 5 11 1 5 1 15 1 1 1 5#include "stdio.h"int p[5][5]={ {1,1,5,5,1}, {5,5,5,1,1...原创 2018-07-28 00:10:42 · 2307 阅读 · 0 评论 -
树的路径和(利用DFS和中序遍历)
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Note: A leaf is a node with no children.Example:Given the below binary tree and sum = 22, 5 ...原创 2018-06-27 00:02:24 · 736 阅读 · 0 评论 -
Binary Tree Paths
Given a binary tree, return all root-to-leaf paths.Note: A leaf is a node with no children.Example:Input: 1 / \2 3 \ 5Output: ["1->2->5", "1->3"]Explanation: All root-to-le...原创 2018-06-13 01:54:18 · 228 阅读 · 0 评论 -
Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Note:All numbers will be p...原创 2018-06-06 08:16:23 · 165 阅读 · 0 评论 -
Number of Islands
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume...原创 2018-06-07 08:54:29 · 130 阅读 · 0 评论 -
Permutations
Given a collection of distinct integers, return all possible permutations.class Solution {public: vector<vector<int>> permute(vector<int>& nums) { vector<vector&...原创 2018-05-26 11:40:10 · 307 阅读 · 0 评论 -
Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.class Solution {public: vector<vector<int>> permuteUnique(vector<int>& num...原创 2018-05-26 11:55:09 · 205 阅读 · 0 评论 -
N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each solu...原创 2018-06-16 00:32:57 · 206 阅读 · 0 评论 -
N-Queens II
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return the number of distinct solutions to the n-queens puzzle...原创 2018-06-16 00:32:42 · 252 阅读 · 0 评论 -
Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.Example:Input: n = 4, k = 2Output:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]class Solution {p...原创 2018-06-19 01:12:06 · 193 阅读 · 0 评论 -
Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[ [3], [1], [2...原创 2018-06-19 01:12:14 · 477 阅读 · 0 评论 -
Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: [1,2,2]Output:...原创 2018-06-21 01:06:12 · 204 阅读 · 0 评论 -
Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.Example:Input: "25525511135"Output: ["255.255.11.135", "255.255.111.35"]class Solutio...原创 2018-06-21 01:08:01 · 213 阅读 · 0 评论 -
Unique Binary Search Trees II
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.Example:Input: 3Output:[ [1,null,3,2], [3,2,null,1], [3,1,null,null,2], [2,1,3], ...原创 2018-06-21 01:08:08 · 217 阅读 · 0 评论 -
Surrounded Regions
Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.Example:X X X XX O O XX X ...原创 2018-06-29 11:51:28 · 174 阅读 · 0 评论 -
79. 单词搜索
给定一个二维网格和一个单词,找出该单词是否存在于网格中。单词必须按照字母顺序,通过相邻的单元格内的字母构成,其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母不允许被重复使用。示例:board =[ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E']]给定 word = "ABCCE...原创 2018-09-06 13:53:38 · 191 阅读 · 0 评论