2016年06月_琥珀彩

原创 leetcode 36. 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

2016-06-24 20:24:28 387

原创 leetcode 35. Search Insert Position

题目：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the arr

2016-06-20 16:26:53 262

原创 leetcode 34. Search for a Range

题目：Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not fou

2016-06-20 16:05:56 256

原创 leetcode 33.Search in Rotated Sorted Array

题目：Suppose a sorted array is rotated at some pivot unknown to you beforehand.假定一个数组是有序的，i.e., 0 1 2 4 5 6 7 可能在某个支点被事先循环了，那么这个数组可能变成了4 5 6 7 0 1 2现在，针对这个事先循环操作过的数组4 5 6 7 0 1 2进行搜索

2016-06-16 17:03:17 312

原创随机森林（Random Forest）

阅读目录•1 什么是随机森林？•2 随机森林的特点•3 随机森林的相关基础知识•4 随机森林的生成•5 袋外错误率（oob error）•6 随机森林工作原理解释的一个简单例子•7 随机森林的Python实现•8 参考内容1 什么是随机森林？　　作为新兴起的、高度灵活的一种机器学习算法，随机森林（Random Forest，简称R

2016-06-16 09:40:19 12324 1

原创 leetcode 32. Longest Valid Parentheses

题目：Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is

2016-06-15 11:09:00 344

原创 leetcode 31. Next Permutation

题目：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.根据字典排序的规则，将现有的序列，变为大一个的序列。If such arrangement is not possible, it must re

2016-06-14 21:25:36 271

原创 leetcode 30. Substring with Concatenation of All Words

题目：You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) ins that is a concatenation of each word in words exactly once

2016-06-13 20:07:26 279

原创 leetcode 29. Divide Two Integers

题目：Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 写一个除法算法，但是不许用多项式，除法符号，取模，当溢出时，返回INT_MAX；解答：开始想法，利用不断的减法，减法的次数即为除法的商，但

2016-06-12 17:13:05 244

原创 leetcode 28. Implement strStr()

题目：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.给了两个字符串，返回一个短的字符串在另一个长字符串中的起始索引纸。长/短字符串分别有标记，不用自己比较哪个长哪个短。

2016-06-08 11:14:17 247

原创 leetcode 25. Reverse Nodes in k-Group

题目：Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.有一个单链表，需要每次反转k个节点，最后返回修改后的链表。If the number of nodes is not a multiple of k then left

2016-06-07 15:07:54 320

原创 leetcode 26. Remove Duplicates from Sorted Array

题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.给一个已经排序的数组，就地移除其中重复元素，并且返回新的长度Do not allocate extra space for an

2016-06-02 09:15:18 297

原创 leetcode 24. Swap Nodes in Pairs

题目：Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant

2016-06-01 10:00:40 265

ac540101928的专栏