04 2015 档案

摘要:#题目简述Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive in... 阅读全文
posted @ 2015-04-22 11:04 mrbean 阅读(574) 评论(0) 推荐(0)
摘要:#题目简述:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are fille... 阅读全文
posted @ 2015-04-18 23:43 mrbean 阅读(306) 评论(0) 推荐(0)
摘要:#题目简述:Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".#解题思路: class Solution: # @pa... 阅读全文
posted @ 2015-04-18 19:10 mrbean 阅读(267) 评论(0) 推荐(0)
摘要:#题目简述Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3... 阅读全文
posted @ 2015-04-18 18:31 mrbean 阅读(229) 评论(0) 推荐(0)
摘要:#题目描述Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or ... 阅读全文
posted @ 2015-04-18 18:15 mrbean 阅读(255) 评论(0) 推荐(0)
摘要:#题目简述Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last ... 阅读全文
posted @ 2015-04-18 16:14 mrbean 阅读(278) 评论(0) 推荐(0)
摘要:#题目简述The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed ... 阅读全文
posted @ 2015-04-18 15:51 mrbean 阅读(281) 评论(0) 推荐(0)
摘要:#题目简述You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stoppi... 阅读全文
posted @ 2015-04-16 16:53 mrbean 阅读(296) 评论(0) 推荐(0)
摘要:#感知机(perceptron)##模型:简答的说由输入空间(特征空间)到输出空间的如下函数:$$f(x)=sign(w\cdot x+b)$$称为感知机,其中,$w$和$b$表示的是感知机模型参数,$w \in R^n$叫做权值,$b \in R$叫做偏置(bias)感知机是一种线性分类模型属于判... 阅读全文
posted @ 2015-04-15 14:24 mrbean 阅读(8950) 评论(0) 推荐(1)
摘要:tar 来自为知笔记(Wiz) 阅读全文
posted @ 2015-04-06 12:57 mrbean 阅读(189) 评论(0) 推荐(0)