2014年11月_sanfendi

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月

原创 Kaggle竞赛题目之——Titanic: Machine Learning from Disaster

The sinking of the RMS Titanic is one of the most infamous shipwrecks in history. On April 15, 1912, during her maiden voyage, the Titanic sank after colliding with an iceberg, killing 1502 out of 22

2014-11-25 19:47:00 5458 4

原创 Kaggle竞赛题目之——Predicting a Biological Response

Predict a biological response of molecules from their chemical properties从分子的化学属性中预测其生物反应。The objective of the competition is to help us build as good a model as possible so that we can, as op

2014-11-24 17:24:00 4942

原创 LeetCode——Subsets

Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For exa

2014-11-23 13:24:16 2178

原创 LeetCode——Simplify Path

Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did

2014-11-22 18:13:22 2023

原创 Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at

2014-11-22 13:42:30 1908

原创 LeetCode——Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest

2014-11-21 18:17:03 2133

原创 LeetCode——Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest

2014-11-21 18:13:18 1657

原创 LeetCode——Sqrt(x)

Implement int sqrt(int x).Compute and return the square root of x.原题链接：https://oj.leetcode.com/problems/sqrtx/使用二分法来解题。 public int sqrt(int x) { if(x == 0 || x== 1) return x; in

2014-11-21 14:28:18 2574

原创 LeetCode——Unique Paths II

Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the

2014-11-21 10:31:23 1997

原创 LeetCode——Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the

2014-11-20 13:48:18 1998

原创 LeetCode——Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.原题链接：https://oj.leetcode.com/proble

2014-11-20 12:54:45 2046

原创 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""3

2014-11-19 17:06:49 2195

原创 LeetCode——Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [

2014-11-19 14:43:45 2067

原创 LeetCode——Jump Game

Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine i

2014-11-19 12:31:47 2192

原创 LeetCode——Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]

2014-11-19 11:11:32 2052

原创 LeetCode——Pow(x, n)

Implement pow(x, n).原题链接：https://oj.leetcode.com/problems/powx-n/ public double pow(double x, int n) { if(n== 0) return 1; if(n == 1) return x; if(n % 2 ==0) return pow(x*x,n/2);

2014-11-18 22:14:44 2280

原创 LeetCode——Anagrams

Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.原题链接：https://oj.leetcode.com/problems/anagrams/易位构词游戏的英文词汇是 anagram，这个词来源于有

2014-11-18 21:44:33 2170

原创 LeetCode——Multiply Strings

Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.原题链接：https://oj.leetcode.com/problems

2014-11-18 17:06:03 2005

原创 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 combina

2014-11-18 15:13:12 1883

原创 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 numb

2014-11-14 23:54:07 1708

原创 LeetCode——Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get

2014-11-13 19:47:17 2034

原创 LeetCode——Valid Number

Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo

2014-11-12 19:07:45 1936

原创 LeetCode——Count and Say

The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as

2014-11-12 18:25:13 1899

原创 LeetCode——Valid Sudoku

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille

2014-11-12 16:33:49 2426