原创 搭建本地Jekyll環境

最近用github搭建了個博客，正好也學習一下markdown語法，由於markdown寫完後不是立即可見，所以每次寫完文章都要經過在線調試，而在線

2020-02-25 10:28:25

原创 [LeetCode] Palindrome Partition [11]

題目 Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible pal

2020-02-25 10:28:25

原创 [ LeetCode ] Single Number II [4]

題目 Given an array of integers, every element appears three times except for one. Find that single one. Note: Your al

2020-02-25 10:28:25

原创 [LeetCode] Implement strStr() [18]

題目 Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not par

2020-02-25 10:28:25

原创 [LeetCode] Merge Sorted Array [22]

題目 Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough

2020-02-25 10:28:25

原创 [LeetCode] Two Sum [17]

題目 Given an array of integers, find two numbers such that they add up to a specific target number. The function twoS

2020-02-25 10:28:25

原创 [LeetCode] Longest Substring Without Repeating Characters [15]

題目 Given a string, find the length of the longest substring without repeating characters. For example, the longest subs

2020-02-25 10:28:25

原创 [LeetCode] Regular Expression Matching [6]

題目： Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches

2020-02-25 10:28:25

原创 [LeetCode] Remove Duplicates from Sorted Array II [27]

題目 Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array

2018-09-03 05:43:44 1

原创 [LeetCode] Binary Tree Postorder Traversal [42]

題目 Binary Tree Postorder Traversal  Total Accepted: 23797 Total Submissions: 76975My Submissions Given a binary

2018-09-03 05:43:44 1

原创 [LeetCode] Subsets II [32]

題目 Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a

2018-09-03 05:43:44

原创 [LeetCode] Interleaving String [30]

題目 Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given:s1 = "aabcc",s2 

2018-09-03 05:43:40

原创 [LeetCode] Distinct Subsequences [29]

題目 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string i

2018-09-03 05:43:39

原创 [LeetCode] Search in Rotated Sorted Array II [36]

題目 Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run-time comp

2018-09-03 05:43:38 2

原创 [LeetCode] Binary Tree Inorder Traversal [41]

題目 Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3},

2018-09-03 05:43:37 2