- 博客(13)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 leetcode 41. First Missing Positive
import java.util.Arrays; //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
2016-06-30 15:57:41
315
原创 leetcode 40. Combination Sum II
import java.util.ArrayList; import java.util.Arrays; import java.util.List; //Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidat
2016-06-29 14:38:40
255
原创 leetcode 39. Combination Sum
import java.util.ArrayList; import java.util.Arrays; import java.util.List; //Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbe
2016-06-29 11:15:19
211
原创 leetcode 38. 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
2016-06-29 09:55:16
238
原创 leetcode 37. Sudoku Solver
public class Solution { public static void main(String[] args) { char[][] input = { {'5','3','.','.','7','.','.','.','.'}, {'6','.','.','1','9','5','.','.','.'}, {'9','8','.','.','.'
2016-06-28 18:44:27
396
原创 数据库操作
导入数据 LOAD DATA LOCAL INFILE 'C:\\Users\\Wen\\Desktop\\user_taggedmovies-timestamps.dat' -- 数据位置 INTO TABLE test -- 要导入的表 FIELDS TERMINATED BY ' ' -- 数据以什么分隔 LINES TERMINA
2016-06-22 10:40:40
251
原创 leetcode 36. Valid Sudoku
public class Solution { public static void main(String[] args) { char[][] input = { {'5','3','.','.','7','.','.','.','.'}, {'6','.','.','1','9','5','.','.','.'}, {'9','8','.','.','.'
2016-06-22 10:36:15
206
原创 leetcode 35. Search Insert Position
import java.util.Stack; //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 n
2016-06-15 11:25:35
168
原创 leetcode 34. Search for a Range
import java.util.Stack; //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
2016-06-15 10:49:36
232
原创 leetcode 33. Search in Rotated Sorted Array
import java.util.Stack; //Suppose a sorted array is rotated at some pivot unknown to you beforehand. //(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). //You are given a target value to search. If f
2016-06-08 11:56:57
214
原创 leetcode 32. Longest Valid Parentheses——（use stack）
import java.util.Stack; //Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. //For "(()", the longest valid parenthes
2016-06-07 09:47:54
282
原创 leetcode 31. Next Permutation
import java.util.Arrays; //Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. //If such arrangement is not possible, it must rearrang
2016-06-02 16:59:54
339
原创 leetcode 30. Substring with Concatenation of All Words
import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; //You are given a string, s, and a list of words, words, that are all of the same length. //Find al
2016-06-01 15:11:25
192
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人