原创 leetcode:Word Break
題目：https://oj.leetcode.com/problems/word-break/ Given a string s and a dictionary of words dict, determine if s can
2020-02-20 14:18:40
原创 leetcode:Clone Gragh
題目：https://oj.leetcode.com/problems/clone-graph/ Clone an undirected graph. Each node in the graph contains a label
2020-02-20 14:18:40
原创 leetcode:Word Break II
題目：https://oj.leetcode.com/problems/word-break-ii/ Given a string s and a dictionary of words dict, add spaces in s t
2020-02-20 14:18:40
原创 leetcode:Longest Consecutive Sequence
題目：https://oj.leetcode.com/problems/longest-consecutive-sequence/ Given an unsorted array of integers, find the leng
2020-02-20 14:18:40
原创 leetcode:Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the
2018-08-28 01:30:41
原创 leetcode:Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitte
2018-08-28 01:30:41
原创 leetcode:Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ...
2018-08-28 01:30:41
原创 leetcode:Subsets
Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descendi
2018-08-28 01:30:41
原创 Sqoop報錯記錄
1，在進行從MySql到hive的數據導入時，出現如下錯誤： Streaming result set com.mysql.jdbc.RowDataDynamic@7c30e29c is still active.No statement
2018-08-28 01:30:41
原创 leetcode:Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1]
2018-08-28 01:30:41
原创 leetcode:Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3},
2018-08-28 01:30:41
原创 leetcode:Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to fi
2018-08-28 01:30:41
原创 leetcode:Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL,
2018-08-28 01:30:41
原创 Sqoop導入hive注意事項
Sqoop從oracle導入數據到hive，示例： sqoop import --connect jdbc:oracle:thin:@oracle-host:port:orcl --username name--password pas
2018-08-28 01:30:41
原创 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:
2018-08-28 01:30:41