Skip to content

Instantly share code, notes, and snippets.

@yangliyi
yangliyi / main.go
Created August 4, 2018 12:22 — forked from enricofoltran/main.go
A simple golang web server with basic logging, tracing, health check, graceful shutdown and zero dependencies
package main
import (
"context"
"flag"
"fmt"
"log"
"net/http"
"os"
"os/signal"
@yangliyi
yangliyi / show.json
Created December 6, 2015 16:11
TopicComments API
{
"id": 210,
"content": "comment1",
"user_id": 109,
"topic_id": 94,
"created_at": "2015-12-07T00:03:06.750+08:00",
"updated_at": "2015-12-07T00:03:06.750+08:00"
}
@yangliyi
yangliyi / index.json
Created December 6, 2015 16:05
TopicComments API
{
"data": [
{
"id": 210,
"content": "comment1",
"user_id": 109,
"topic_id": 94,
"created_at": "2015-12-07T00:03:06.750+08:00",
"updated_at": "2015-12-07T00:03:06.750+08:00"
},
@yangliyi
yangliyi / uglyNumber.js
Last active October 18, 2016 08:44
LeetCode / Ruby / JavaScript / Swift
##### JavaScript #####
# Solution1
var isUgly = function(num) {
if(num <= 0){
return false;
} else if (num === 1) {
return true;
}
while(num % 2 === 0){
@yangliyi
yangliyi / Climbing Stairs
Created November 23, 2015 10:50
LeetCode / Ruby / JavaScript
##### Ruby #####
# Solution1
def climb_stairs(n)
result = []
result[0] = 0;
result[1] = 1;
result[2] = 2;
for i in 3..n do
result[i] = result[i - 1] + result[i - 2];
@yangliyi
yangliyi / Majority Element
Last active September 5, 2016 14:32
LeetCode / Ruby JavaScript
##### Ruby #####
# Solution1
def majority_element(nums)
h = (nums.size.to_f / 2).ceil
sorted = nums.sort
return sorted[h]
end
# Solution2
@yangliyi
yangliyi / Product of Array Except Self
Created November 23, 2015 10:48
LeetCode / Ruby / JavaScript
##### Ruby #####
# Solution1
def product_except_self(nums)
length = nums.length
result = [1]
for i in 0..(length-2) do
result << result[i] * nums[i]
end
i = length - 1
@yangliyi
yangliyi / Best Time to Buy and Sell Stock
Created November 23, 2015 10:47
LeetCode / Ruby / JavaScript
##### Ruby #####
# Solution1
def max_profit(prices)
return 0 if prices.length <= 1
profit = 0
for i in 1..(prices.length-1) do
if prices[i] > prices[i-1]
profit = profit + (prices[i] - prices[i-1])
end
@yangliyi
yangliyi / isAnagram.js
Last active September 5, 2016 14:33
LeetCode / Ruby / JavaScript / Swift
##### JavaScript #####
# Solution1
var isAnagram = function(s, t) {
if(s.length !== t.length){
return false;
}
var checkList = {};
for(i = 0; i < s.length; i++){
if(!checkList[s[i]]){
@yangliyi
yangliyi / Contains Duplicate
Last active September 5, 2016 14:33
LeetCode / Ruby / JavaScript
##### Ruby #####
# Solution1
def contains_duplicate(nums)
result = false
if nums.length == 1
return result
end
sorted = nums.sort
for i in 0..(sorted.length-2) do