哥布林工程师

2016年2月21日

lintcode-easy-Binary Tree Inorder Traversal

摘要： Given a binary tree, return the inorder traversal of its nodes' values. Example Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,3,2]. Challenge Can y 阅读全文

posted @ 2016-02-21 11:07 哥布林工程师阅读(137) 评论(0) 推荐(0) 编辑

lintcode-easy-Add two numbers

摘要： You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's 阅读全文

posted @ 2016-02-21 10:29 哥布林工程师阅读(146) 评论(0) 推荐(0) 编辑

2016年2月18日

lintcode-easy-Add Binary

摘要： Given two binary strings, return their sum (also a binary string). Example a = 11 b = 1 Return 100 这道题也没太多好说的…… public class Solution { /** * @param a 阅读全文

posted @ 2016-02-18 17:53 哥布林工程师阅读(114) 评论(0) 推荐(0) 编辑

lintcode-easy-A+B problem

摘要： Write a function that add two numbers A and B. You should not use + or any arithmetic operators. Example Given a=1 and b=2 return 3 Note There is no n 阅读全文

posted @ 2016-02-18 13:25 哥布林工程师阅读(193) 评论(0) 推荐(0) 编辑

lintcode-easy-Remove Linked List Elements

摘要： Remove all elements from a linked list of integers that have value val. Example Given 1->2->3->3->4->5->3, val = 3, you should return the list as1->2- 阅读全文

posted @ 2016-02-18 13:06 哥布林工程师阅读(137) 评论(0) 推荐(0) 编辑

lintcode-easy-Fibonacci

摘要： Find the Nth number in Fibonacci sequence. A Fibonacci sequence is defined as follow: The first two numbers are 0 and 1. The i th number is the sum of 阅读全文

posted @ 2016-02-18 12:52 哥布林工程师阅读(127) 评论(0) 推荐(0) 编辑

哥布林工程师

公告