- 博客(14)
- 资源 (7)
- 收藏
- 关注
RSS订阅原创 <LeetCode OJ> 338. Counting Bits
Total Accepted: 7119 Total Submissions: 12947 Difficulty: MediumGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their
2016-03-26 12:12:37
1304
原创 <LeetCode OJ> 337. House Robber III
Total Accepted: 1341 Total Submissions: 3744 Difficulty: MediumThe thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." B
2016-03-14 23:41:39
2446
3
原创 <LeetCode OJ> 39 / 40 / 216 Combination Sum(I / II / III)
Total Accepted: 83289 Total Submissions: 274461 Difficulty: MediumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numb
2016-03-11 09:11:42
1637
原创 <LeetCode OJ> 274 / 275 H-Index(I / II)
Total Accepted: 37719 Total Submissions: 125936 Difficulty: MediumGiven an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the res
2016-03-10 20:17:19
1349
原创 <LeetCode OJ> 78 / 90 Subsets (I / II)
Total Accepted: 87879 Total Submissions: 285264 Difficulty: MediumGiven a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-desce
2016-03-10 11:24:30
1827
2
原创 <LeetCode OJ> 77. Combinations
Total Accepted: 69360 Total Submissions: 206274 Difficulty: MediumGiven two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k =
2016-03-09 15:35:14
2971
3
原创 2016华为软件精英挑战赛：赛题及其答疑汇总
前言赛题源自“未来网络”业务发放中的路由计算问题。算路问题属于基础算法问题，在图论、网络、交通等各个方面均有着广泛的研究与运用，里面不乏一些经典的算法，例如最短路中的广度优先搜索，Dijkstra算法等。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。1 问题定义给定一个带权重的有向图G=(V,E)，V为顶点集，E为有向边集，每一条有向边均有一个权重。对于给定的顶点s、
2016-03-08 09:55:03
49681
3
原创 <LeetCode OJ> 73. Set Matrix Zeroes
Total Accepted: 60832 Total Submissions: 184016 Difficulty: MediumGiven a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.F
2016-03-07 20:14:45
2138
原创 <LeetCode OJ> 110. Balanced Binary Tree
110. Balanced Binary TreeTotal Accepted: 100175 Total Submissions: 298232 Difficulty: EasyGiven a binary tree, determine if it is height-balanced.For this problem, a height-balance
2016-03-06 09:06:56
1287
原创 LeetCode总结，动态规划问题小结
一，参考一般书籍中的“动态规划”讲解1、基本概念动态规划（Dynamic Programming）对于子问题重叠的情况特别有效，因为它将子问题的解保存在表格中，当需要某个子问题的解时，直接取值即可，从而避免重复计算！动态规划是一种灵活的方法，不存在一种万能的动态规划算法可以解决各类最优化问题（每种算法都有它的缺陷）。所以除了要对基本概念和方法正确理解外，必须具体问题具体分析处理，用
2016-03-04 23:50:32
9555
1
转载 数字图像处理，Matlab常用图像处理函数汇总
原文地址：Matlab图像处理函数汇总作者：mimi图像的变换 ① fft2：fft2函数用于数字图像的二维傅立叶变换，如：i=imread('104_8.tif');j=fft2(i);②ifft2:：ifft2函数用于数字图像的二维傅立叶反变换，如： i=imread('104_8.tif'); j=fft2(i); k=ifft2(j);
2016-03-03 14:39:15
15755
原创 <LeetCode OJ> 151. Reverse Words in a String
151. Reverse Words in a StringMy SubmissionsQuestionTotal Accepted: 93077 Total Submissions: 596183 Difficulty: MediumGiven an input string, reverse the string word by word.F
2016-03-03 10:37:10
1175
原创 LeetCode总结，二分法一般性总结
其实，二分法真的不那么简单，尤其是二分法的各个变种。 最最简单的二分法，就是从一个排好序的数组之查找一个key值。 如下面的程序：点击(此处)折叠或打开int search(int *arr, int n, int key){ int left = 0, right = n-1; while(left=right) {
2016-03-01 21:47:23
26059
3
原创 <LeetCode OJ> 34. Search for a Range
34. Search for a RangeMy SubmissionsQuestionTotal Accepted: 75021 Total Submissions: 261472 Difficulty: MediumGiven a sorted array of integers, find the starting and ending pos
2016-03-01 14:11:00
1031
使用NSIS制作的多功能工具，有利于定位问题，辅助解决问题
2022-03-07
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人