Coding菌 - 博客园

LeetCode（37） Sudoku Solver

摘要：题目Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character ‘.’.You may assume that ther... 阅读全文

posted @ 2015-10-04 16:06 Coding菌阅读(109) 评论(0) 推荐(0) 编辑

LeetCode（71） Simplify Path

摘要：题目Given an absolute path for a file (Unix-style), simplify it.For example, path = “/home/”, => “/home” path = “/a/./b/../../c/”, => “/c” clic... 阅读全文

posted @ 2015-10-03 14:20 Coding菌阅读(165) 评论(0) 推荐(0) 编辑

LeetCode（69） Sqrt(x)

摘要：题目Total Accepted: 67411 Total Submissions: 286086 Difficulty: Medium Implement int sqrt(int x).Compute and return the square root of x.分析不适用库... 阅读全文

posted @ 2015-10-03 13:11 Coding菌阅读(580) 评论(0) 推荐(0) 编辑

LeetCode（52） N-Queens II

摘要：题目Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.分析N皇后问题，同LeetCod... 阅读全文

posted @ 2015-10-02 20:24 Coding菌阅读(173) 评论(0) 推荐(0) 编辑

LeetCode（51） 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,... 阅读全文

posted @ 2015-10-02 20:04 Coding菌阅读(183) 评论(0) 推荐(0) 编辑

LeetCode（101）Symmetric Tree

摘要：题目Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: ... 阅读全文

posted @ 2015-10-01 17:32 Coding菌阅读(165) 评论(0) 推荐(0) 编辑

LeetCode（100） Same Tree

摘要：题目Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally i... 阅读全文

posted @ 2015-10-01 17:13 Coding菌阅读(104) 评论(0) 推荐(0) 编辑

LeetCode（42）Trapping Rain Water

摘要：题目Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap aft... 阅读全文

posted @ 2015-09-29 13:23 Coding菌阅读(109) 评论(0) 推荐(0) 编辑

LeetCode （32） Longest Valid Parentheses

摘要：题目Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.For “((... 阅读全文

posted @ 2015-09-28 14:19 Coding菌阅读(103) 评论(0) 推荐(0) 编辑

LeetCode（10） Regular Expression Matching

摘要：题目Implement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character. ‘*’ Matches zero or more of the preced... 阅读全文

posted @ 2015-09-28 13:45 Coding菌阅读(88) 评论(0) 推荐(0) 编辑

导航

2015年10月4日

2015年10月3日

2015年10月2日

2015年10月1日

2015年9月29日

2015年9月28日


Copyright © 2024 Coding菌 Powered by .NET 8.0 on Kubernetes 博客园