自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

EbowTang的练习场

1,新手需要努力,高手更需要努力。2,性格大于能力。3,解决问题的能力决定未来。

  • 博客(280)
  • 资源 (7)
  • 收藏
  • 关注

原创 <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 49680 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

原创 LeetCode总结,递归的理解与设计

一,简介递归的原理递归算法:是一种直接或者间接地调用自身的算法。在计算机编写程序中,递归算法对解决一大类问题是十分有效的,它往往使算法的描述简洁而且易于理解。1,参考于书籍中的讲解:递归算法的实质:是把问题转化为规模缩小了的同类问题的子问题。然后递归调用函数(或过程)来表示问题的解。递归的原理基于子问题,子问题只是一个小的规模的父问题,因为本文是假设子问题能够求解的,而父问

2016-02-29 10:16:13 3842

原创 <LeetCode OJ> 96. Unique Binary Search Trees

96. Unique Binary Search TreesMy SubmissionsQuestionTotal Accepted: 75913 Total Submissions: 205774 Difficulty: MediumGiven n, how many structurally unique BST's (binary search

2016-02-26 21:07:29 1423

原创 <LeetCode OJ> 278. First Bad Version

278. First Bad VersionMy SubmissionsQuestionTotal Accepted: 33285 Total Submissions: 152183 Difficulty: EasyYou are a product manager and currently leading a team to develop a

2016-02-25 10:40:06 1479

原创 <LeetCode OJ> 35. Search Insert Position

35. Search Insert PositionMy SubmissionsQuestionTotal Accepted: 94638 Total Submissions: 256951 Difficulty: MediumGiven a sorted array and a target value, return the index if t

2016-02-24 23:17:29 1966

原创 <LeetCode OJ> 49. Group Anagrams

49. Group AnagramsMy SubmissionsQuestionTotal Accepted: 66408 Total Submissions: 249691 Difficulty: MediumGiven an array of strings, group anagrams together.For example, give

2016-02-23 23:02:14 1414

原创 <LeetCode OJ> 103. Binary Tree Zigzag Level Order Traversal

103. Binary Tree Zigzag Level Order TraversalMy SubmissionsQuestionTotal Accepted: 54617 Total Submissions: 194980 Difficulty: MediumGiven a binary tree, return the zigzag leve

2016-02-23 14:46:22 1222

原创 <LeetCode OJ> 102. / 107. Binary Tree Level Order Traversal(I / II)

102. Binary Tree Level Order TraversalMy SubmissionsQuestionTotal Accepted: 90536 Total Submissions: 284466 Difficulty: EasyGiven a binary tree, return the level order traversa

2016-02-22 22:27:45 1689

原创 <LeetCode OJ> 235. / 236. LCA of a BSTree & BTree

235. Lowest Common Ancestor of a Binary Search TreeMy SubmissionsQuestionTotal Accepted: 54510 Total Submissions: 143305 Difficulty: EasyGiven a binary search tree (BST), find

2016-02-21 15:34:16 1622

原创 <LeetCode OJ> 5. Longest Palindromic Substring

5. Longest Palindromic SubstringMy SubmissionsQuestionTotal Accepted: 93832 Total Submissions: 418691 Difficulty: MediumGiven a string S, find the longest palindromic substring

2016-02-19 16:25:21 3263 1

原创 <LeetCode OJ> 74. / 240. Search a 2D Matrix (I / II)

240. Search a 2D Matrix IIMy SubmissionsQuestionTotal Accepted: 28527 Total Submissions: 85566 Difficulty: MediumWrite an efficient algorithm that searches for a value in an m

2016-02-18 20:57:43 1278

原创 <LeetCode OJ> 118 / 119 Pascal's Triangle(I / II)

118. Pascal's TriangleMy SubmissionsQuestionTotal Accepted: 73965 Total Submissions: 227957 Difficulty: EasyGiven numRows, generate the first numRows of Pascal's triangle.For

2016-02-18 19:01:45 1451 2

原创 <LeetCode OJ> 120. Triangle

120. TriangleMy SubmissionsQuestionTotal Accepted: 62741 Total Submissions: 213503 Difficulty: MediumGiven a triangle, find the minimum path sum from top to bottom. Each step y

2016-02-18 16:48:24 2050

原创 本博客LeetCode题解索引及各类算法问题小结汇总(C++实现)

Some explains:1),The current problems have been solved:Welcome, EbowTang! You have solved 101 / 316 problems.(update::2016/02/15)2),All problems are coded with C++3),There are 333 problems (about 54 problems for a fee).4),I will update this article fo

2016-02-15 17:18:57 9143

原创 <LeetCode OJ> 290. Word Pattern

290. Word PatternMy SubmissionsQuestionTotal Accepted: 24989 Total Submissions: 89440 Difficulty: EasyGiven a pattern and a string str, find if str follows the same pattern.

2016-02-11 18:09:54 1502

原创 <LeetCode OJ> 228. Summary Ranges

228. Summary RangesMy SubmissionsQuestionTotal Accepted: 36554 Total Submissions: 159532 Difficulty: EasyGiven a sorted integer array without duplicates, return the summary of

2016-02-10 16:11:10 1190

原创 <LeetCode OJ> 14. Longest Common Prefix

14. Longest Common PrefixMy SubmissionsQuestionTotal Accepted: 85063 Total Submissions: 312335 Difficulty: EasyWrite a function to find the longest common prefix string amongst

2016-02-07 17:45:21 1046

原创 <LeetCode OJ> 64. Minimum Path Sum

64. Minimum Path SumMy SubmissionsQuestionTotal Accepted: 62294 Total Submissions: 183284 Difficulty: MediumGiven a m x n grid filled with non-negative numbers, find a path fro

2016-02-06 13:42:09 2918

原创 <LeetCode OJ> 328. Odd Even Linked List

328. Odd Even Linked ListMy SubmissionsQuestionTotal Accepted: 9271 Total Submissions: 24497 Difficulty: EasyGiven a singly linked list, group all odd nodes together followed b

2016-01-30 16:38:44 1831

原创 <LeetCode OJ> 287. Find the Duplicate Number

1). 使用快慢指针法,若链表中有环,可以得到两指针的交点M2). 记链表的头节点为H,环的起点为E

2016-01-27 09:53:52 1627 1

原创 <LeetCode OJ> 327. Count of Range Sum

327. Count of Range SumMy SubmissionsQuestionTotal Accepted: 93 Total Submissions: 316 Difficulty: Hard给定一个整数数组nums,返回该数组某个"范围内的和"在 [ lower,upper ] 之间的总数量Given an integer array

2016-01-26 15:28:31 2604

原创 <LeetCode OJ> 52. N-Queens II

52. N-Queens IIMy SubmissionsQuestionTotal Accepted: 39648 Total Submissions: 103862 Difficulty: HardFollow up for N-Queens problem.Now, instead outputting board configuratio

2016-01-26 11:12:57 1620 1

原创 <LeetCode OJ> 125. Valid Palindrome

125. Valid PalindromeMy SubmissionsQuestionTotal Accepted: 85331 Total Submissions: 369741 Difficulty: Easy给定一个字符串,判断是否为回文字符串,只需考虑字母和数字,忽略空格。注意:空字符串算作回文字符串。Given a string, de

2016-01-25 21:41:00 1132

原创 <LeetCode OJ> 43. Multiply Strings

43. Multiply StringsMy SubmissionsQuestionTotal Accepted: 51859 Total Submissions: 231017 Difficulty: Medium以字符串的形式给定两个数字,返回相乘的结果,注意:结果也是字符串,因为数字可能很大Given two numbers represent

2016-01-24 21:25:00 2217

原创 <LeetCode OJ> 238. Product of Array Except Self

238. Product of Array Except SelfMy SubmissionsQuestionTotal Accepted: 31438 Total Submissions: 77077 Difficulty: Medium给定一个数组nums,且其长度大于1,返回一个数组output,此数组output[i]等于除掉nums[i]外所有

2016-01-24 19:38:38 1030

原创 <LeetCode OJ> 144 / 145 / 94 Binary Tree (Pre & In & Post) order Traversal

在此之前回顾前序遍历和中序遍历:1,前序遍历:基本规则,总是先访问根节点在左节点,在右节点递归解法:class Solution {public: vector result; vector preorderTraversal(TreeNode* root) { if(root){ result.push_back(root

2016-01-24 10:51:37 1792

原创 <LeetCode OJ> 215. Kth Largest Element in an Array

215. Kth Largest Element in an ArrayMy SubmissionsQuestionTotal Accepted: 38315 Total Submissions: 123284 Difficulty: Medium在一个未排序的数组中找到第k大的元素,注意此言的第k大就是排序后的第k大的数,注意:给定k总是安全有效的

2016-01-23 17:09:31 1248

原创 <LeetCode OJ> 230. Kth Smallest Element in a BST

230. Kth Smallest Element in a BSTMy SubmissionsQuestionTotal Accepted: 32753 Total Submissions: 93019 Difficulty: Medium给定一个二叉搜索树,写一个函数找到二叉树中第k小的值Given a binary search tree, w

2016-01-22 22:07:58 1294

原创 <LeetCode OJ> 101. Symmetric Tree

101. Symmetric TreeMy SubmissionsQuestionTotal Accepted: 90196 Total Submissions: 273390 Difficulty: EasyGiven a binary tree, check whether it is a mirror of itself (ie, symmet

2016-01-22 16:48:19 1435

原创 <LeetCode OJ> 22. Generate Parentheses

22. Generate ParenthesesMy SubmissionsQuestionTotal Accepted: 74274 Total Submissions: 211279 Difficulty: MediumGiven n pairs of parentheses, write a function to generate all c

2016-01-21 20:28:42 1264

原创 <LeetCode OJ> 169. Majority Element

169. Majority ElementMy SubmissionsQuestionTotal Accepted: 87072 Total Submissions: 222273 Difficulty: EasyGiven an array of size n, find the majority element. The majority ele

2016-01-19 15:01:02 1195

使用NSIS制作的多功能工具,有利于定位问题,辅助解决问题

平时自己办公和处理问题,经常使用todesk远程局点环境,此时往往涉及到如下需求 1,需要特定的工具测试局点网络环境 2,禁用windwos自动更新服务解决问题(在云桌面中会引起很多问题) 3,卸载windows内置应用,以及深度优化系统,比如在和友商PK时 4,启用业务功能上诸多功能 5,分析故障系统各项指标(集成各种分析工具) 6,解析业务上的加密配置文件 7,快速共享本机文件夹(极大的利于定位问题,传递文件) 上述功能需求使用NSIS工具统一制作,并且打包出来的小程序体积很小,有类似需求的可以看看

2022-03-07

小波变换程序

二维的变换实测运算速度很慢,写得很烂,写了很久了,一维的还好!对于这份资源你千万要有自己的思考(结合matlab运行验证验证)。

2017-06-08

MFC类库速查手册

MFC中文版的类库速查手册,囊括了绝大部分MFC类库,可以帮助英语不好的同学,但是个人建议还是最好看英文版的!

2015-01-16

Matlab五种常见铝箔方式去噪能力对比

四种不同噪声下的五种滤波方式去噪能力对比,其中罗列的完整的数据以及一些简单分析,主要还是适合初学者!

2014-11-13

MFC,多线程例子,计算素数

这个例子来源于mfc windows程序设计多线程章节的例子

2014-07-09

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除