2014年06月_剑侠月影

10月 09月 08月 07月 06月 05月 04月

转载梯度下降法

回归(regression)、梯度下降(gradient descent) 前言: 上次写过一篇关于贝叶斯概率论的数学，最近时间比较紧，coding的任务比较重，不过还是抽空看了一些机器学习的书和视频，其中很推荐两个：一个是 stanford的machine learning公开课，在verycd可下载，可惜没有翻译。不过还是可以看。另外一个是prml-pattern recognit

2014-06-18 10:35:17 721

原创 LeetCode Divide Two Integers(***)

Divide two integers without using multiplication, division and mod operator.

2014-06-17 15:38:40 512

原创 CareerCup Chapter 9 Sorting and Searching

You are given two sorted arrays, A and B, and A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.

2014-06-14 17:43:54 1413

原创 LeetCode Palindrome Partitioning II(***)

Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s = "aab", Retur

2014-06-13 21:56:48 537

原创 LeetCode Longest Palindromic Substring

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

2014-06-13 20:09:51 466

原创 LeetCode Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the l

2014-06-13 19:24:58 594 1

原创 LeetCode Same Tree

Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

2014-06-13 19:13:15 503

原创 LeetCode Pascal's Triangle II

Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space?

2014-06-13 19:03:04 516

原创 LeetCode Combinations

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1

2014-06-13 18:49:12 626

原创 CareerCup chapter 8 Recursion

8.1 Write a method to generate the nth Fibonacci number. Recusion

2014-06-12 11:51:06 814

原创 LeetCode First Missing Positive

Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses constant spa

2014-06-11 21:30:30 443

原创 LeetCode Permutation Sequence

The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3): "123""132""213""231""312"

2014-06-11 21:03:22 526

原创 LeetCode Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [3,2,1]. Note: Recursive solution is tr

2014-06-11 20:25:16 411

原创 LeetCode Combination Sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimited number

2014-06-11 19:58:14 454

原创 LeetCode Merge Sorted Array

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 equal to m + n) to hold additional elements from B

2014-06-11 19:43:52 428

原创 Leetcode Add Binary

Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". class Solution { public: string addBinary(string a, string b) { if(a.

2014-06-11 19:28:52 587

原创 Leetcode 3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: Elements in a triplet (a,b,c

2014-06-11 19:16:12 428

原创 Leetcode Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the combinat

2014-06-11 16:58:53 474

原创 Leetcode Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. di

2014-06-11 16:29:51 1185

原创 Leetcode Reverse Words in a String

Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". click to show clarification. Clarification: What constitutes a word?

2014-06-11 15:42:21 610

原创 CareerCup chapter 5 Bit Manipulation

5.1 You are given two 32-bit numbers, N and M, and two bit positions, i and j Write a method to set all bits between i and j in N equal to M (e g , M becomes a substring of N located at i and starting

2014-06-07 09:58:42 712