- 博客(17)
- 资源 (7)
- 收藏
- 关注
RSS订阅原创 <LeetCode OJ> 241. Different Ways to Add Parentheses
Total Accepted: 23674 Total Submissions: 65569 Difficulty: MediumGiven a string of numbers and operators, return all possible results from computing all the different possible ways to grou
2016-06-16 09:16:57
2010
原创 <LeetCode OJ> 334. Increasing Triplet Subsequence
Total Accepted: 16003 Total Submissions: 46481 Difficulty: MediumGiven an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the func
2016-06-14 20:20:17
1116
原创 <LeetCode OJ> 318. Maximum Product of Word Lengths
Total Accepted: 23617 Total Submissions: 58995 Difficulty: MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share
2016-06-13 20:31:51
2509
原创 <LeetCode OJ> 173. Binary Search Tree Iterator
Total Accepted: 50775 Total Submissions: 144066 Difficulty: MediumImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Cal
2016-06-13 19:35:59
1152
原创 <LeetCode OJ> 357. Count Numbers with Unique Digits
Total Accepted: 450 Total Submissions: 1077 Difficulty: MediumGiven a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (Th
2016-06-13 17:26:10
1591
原创 <LeetCode OJ> 60. Permutation Sequence
Total Accepted: 56468 Total Submissions: 221337 Difficulty: MediumThe set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in orde
2016-06-12 22:57:23
1368
原创 <LeetCode OJ> 114. Flatten Binary Tree to Linked List
Total Accepted: 84864 Total Submissions: 270352 Difficulty: MediumGiven a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5
2016-06-12 17:57:40
1352
原创 <LeetCode OJ> 201. Bitwise AND of Numbers Range
Total Accepted: 35859 Total Submissions: 115817 Difficulty: MediumGiven a range [m, n] where 0 For example, given the range [5, 7], you should return 4.Credits:Special thanks to @amr
2016-06-12 11:06:00
1142
原创 数字图像处理，一种简单的颜色平衡算法
对于黯淡的彩色图像调节效果.........对于暗淡图像的调节，灰度直方图基本均匀碾平：对于过度饱和图像的效果，右上角展示了直返图的效果，可以看见基本均匀碾平了：参考代码：#include "string"#include "vector"#include #include #include //opencv_no
2016-06-11 21:47:19
6753
1
原创 <LeetCode OJ> 200 / 130 Number of Islands / Surrounded Regions
Total Accepted: 48411 Total Submissions: 171609 Difficulty: MediumGiven a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and
2016-06-11 16:36:36
1462
原创 <LeetCode OJ> 48. Rotate Image
Total Accepted: 69879 Total Submissions: 199786 Difficulty: MediumYou are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could yo
2016-06-05 16:27:07
2204
原创 <LeetCode OJ> 54 / 59 Spiral Matrix( I / II )
Total Accepted: 61182 Total Submissions: 268396 Difficulty: MediumGiven a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Gi
2016-06-04 18:05:45
1228
原创 <LeetCode OJ> 106. Construct Binary Tree from Inorder and Postorder Traversal
Total Accepted: 56569 Total Submissions: 193357 Difficulty: MediumGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not
2016-06-03 22:43:25
1129
原创 <LeetCode OJ> 105. Construct Binary Tree from Preorder and Inorder Traversal
Total Accepted: 65143 Total Submissions: 224882 Difficulty: MediumGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not e
2016-06-03 18:08:36
1333
原创 <LeetCode OJ> 109 / 108 Convert Sorted ( List / Array ) to Binary Search Tree
Total Accepted: 71642 Total Submissions: 233074 Difficulty: MediumGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Subscri
2016-06-02 21:48:27
1130
原创 LeetCode总结，回溯法小结
一，回溯法思想回溯法概念 回溯算法实际上一个类似枚举的搜索尝试过程，主要是在搜索尝试过程中寻找问题的解，当发现已不满足求解条件时，就“回溯”返回，尝试别的路径。 回溯法是一种选优搜索法，按选优条件向前搜索，以达到目标。但当探索到某一步时，发现原先选择并不优或达不到目标，就退回一步重新选择，这种走不通就退回再走的技术为回溯法，而满足回溯条件的某个状态
2016-06-02 21:31:15
16919
2
原创 <LeetCode OJ> 319. Bulb Switcher
Total Accepted: 20000 Total Submissions: 48830 Difficulty: MediumThere are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the thi
2016-06-02 09:00:07
1113
使用NSIS制作的多功能工具，有利于定位问题，辅助解决问题
2022-03-07
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人