2017年01月_guoyuhaoaaa

原创 483. Smallest Good Base

For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1.Now given a string representing n, you should return the smallest good base of n in string format. The range of n is [3,

2017-01-30 10:07:22 1822

原创 491. Increasing Subsequences

Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .Example: Input: [4

2017-01-30 09:50:57 364

原创 312. Burst Balloons

Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[lef

2017-01-18 09:49:51 347

原创理解upper_bound()和lower_bound()函数

不多说，先给出两个函数的定义：函数lower_bound()在first和last中的前闭后开区间进行二分查找，返回大于或等于val的第一个元素位置。如果所有元素都小于val，则返回last的位置。函数upper_bound()在first和last中的前闭后开区间进行二分查找，返回大于val的第一个元素位置。如果所有元素都小于val，则返回last的位置。其实含义含义还是比较明白的，下面我自己根

2017-01-17 15:58:05 3023

原创 220. Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference b

2017-01-17 15:17:54 452

原创 115. Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of

2017-01-17 10:11:58 306

原创深度残差网络和Highway网络

今天讲的这两种网络结构都是最新被业界针对图像处理问题提出的最新的结构，主要解决就是超深层的网络在训练优化中遇到的问题。说实话这两种模型就本身来说数学公式都不复杂，但是确实在实战中取得了非常好的效果（深度残差网络帮助微软的团队以绝对优势获得了2015 Image Cup的冠军），这也从侧面说明了深度学习是一门以实践为主导的学科，在这个领域里实践才是检验真理的唯一标准。（很多新的结构都是因为在实践中取得

2017-01-05 15:51:00 12421

guoyuhaoaaa的博客