原创 Leetcode -- Integer to Roman

題目: Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999. 分析:羅馬

原创 Leetcode -- Reorder List

題目: Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-pl

原创 Leetcode -- Remove Duplicates from Sorted List II

題目: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from t

原创 Leetcode -- Remove Linked List Elements

題目: Remove all elements from a linked list of integers that have value val. Example Given: 1 –> 2 –> 6 –> 3 –> 4

原创 Leetcode -- 3Sum Closest

題目: Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. R

原创 Leetcode -- Two Sum

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

原创 Sublime Text3 -- 好用的插件

Pretty Json: 將json文件轉成樹狀,易讀形式。 快捷鍵: ctrl + alt + j Jsonlint: 可以檢查json文件中的語法錯誤。 SublimeText3 package control 的安裝

原创 Leetcode -- Maximum Subarray

題目: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For exam

原创 Leetcode -- Count Primes

題目: Description: Count the number of prime numbers less than a non-negative number, n. Credits: Special thanks to @

原创 Leetcode -- Bitwise AND of Numbers Range

題目: Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusi

原创 Leetcode -- Ugly Number II

題目: Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include

原创 Leetcode -- Word Search(Important!)

題目: Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of seq

原创 【轉載】[CSS] CSS position 觀念筆記心得

轉載地址:http://blog.rx836.tw/blog/css-positioning/ css position 對於初學者來說觀念很容易混淆,我在剛學習時也很常搞不清楚relative和absolute之間的關係,但只要抓到幾

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

原创 Leetcode -- Single Number

Single Number I: Given an array of integers, every element appears twice except for one. Find that single one. 分析: 異或