2017年10月_StepForewardMonthly

原创 Leetcode:303. Range Sum Query - Immutable(week 8)

Description:Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example: Given nums = [-2, 0, 3, -5, 2, -1] sumRange(0, 2) -> 1 sumRange(2, 5) -

2017-10-28 19:57:36 143

原创 Leetcode:402. Remove K Digits (Week 7)

Description:Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible. Note: The length of num is less than 10002 and

2017-10-16 13:50:49 182

原创 Leetcode:455. Assign Cookies (week 7)

Description:Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum si

2017-10-16 13:08:17 158

原创 Leetcode:657. Judge Route Circle (week 7)

Description:Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place. The move sequence is re

2017-10-16 12:52:51 130

原创数字图像处理之直方图均衡化与匹配算法

本文为原创，有很多不足之处望斧正！实验内容一实现river.jpg 图像的直方图均衡，不能直接使用Matlab的histeq( )函数。将有关均衡图像和调用histeq( )函数的结果作比较。实验原理及算法描述直方图均衡化是通过把原图像的直方图经过变换函数修正为分布比较均匀的直方图，从而改变图像整体偏亮或偏暗，提高细节的对比度和辨识力，改善灰度层次不丰富的情况的技术。直方图均衡化过程解析：设r和s分

2017-10-14 19:59:36 4267

原创 Leetcode:2. Add Two Numbers(Week 6)

Description:You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers a

2017-10-14 19:13:47 139

原创 Leetcode: 654. Maximum Binary Tree

Description:Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:The root is the maximum number in the array. The left subtree is the maximum tree cons

2017-10-10 10:27:51 182

原创 Leetcode:493. Reverse Pairs

Description:Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j].You need to return the number of important reverse pairs in the given array. Example1: Inp

2017-10-08 23:25:16 401

原创 Leetcode:Median of Two Sorted Arrays

Description:There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1:

2017-10-01 20:41:52 128

csdn_cinderella的博客