elmagnifico's blog

LeetCode Solution(Easy.57-60)

c/c++，python，for work

57.Implement strStr() Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 57.Implement strStr()-Analysis 判断一个字符串是否是另外一个...

Posted on December 15, 2015; Words: 1204

LeetCode Solution(Easy.53-56)

c/c++，python，for work

53.Add Binary Given two binary strings, return their sum (also a binary string). For example a = "11" b = "1" Return “100”. 53.Add Binary-Analysis 给二进制的string 然后求和还能更简单吗？方法一把string的二进制直接转...

Posted on December 14, 2015; Words: 1083

LeetCode Solution(Easy.49-52)

c/c++，python，for work

49.Count and Say The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11. 11 is read off as "two 1s" or 21. 21 is...

Posted on December 14, 2015; Words: 970

LeetCode Solution(Easy.45-48)

c/c++，python，for work

45.Remove Nth Node From End of List Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. Afte...

Posted on December 13, 2015; Words: 1081

LeetCode Solution(Easy.41-44)

c/c++，python，for work

41.Valid Sudoku Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’. A par...

Posted on December 13, 2015; Words: 870

LeetCode Solution(Easy.37-40)

c/c++，python，for work

37.Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 37...

Posted on December 12, 2015; Words: 843

LeetCode Solution(Easy.33-36)

c/c++，python，for work

33.Binary Tree Level Order Traversal Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#...

Posted on December 12, 2015; Words: 1169

LeetCode Solution(Easy.29-32)

c/c++，python，for work

29.Plus One Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 29.Plus ...

Posted on December 11, 2015; Words: 511

LeetCode Solution(Easy.25-28)

c/c++，python，for work

25.Remove Element Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn’t matter what you leave beyond ...

Posted on December 11, 2015; Words: 1165

LeetCode Solution(Easy.21-24)

c/c++，python，for work

21.Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 21.Climbi...

Posted on December 10, 2015; Words: 1258

Elmagnifico's Blog

LeetCode Solution(Easy.57-60)

c/c++，python，for work

LeetCode Solution(Easy.53-56)

c/c++，python，for work

LeetCode Solution(Easy.49-52)

c/c++，python，for work

LeetCode Solution(Easy.45-48)

c/c++，python，for work

LeetCode Solution(Easy.41-44)

c/c++，python，for work

LeetCode Solution(Easy.37-40)

c/c++，python，for work

LeetCode Solution(Easy.33-36)

c/c++，python，for work

LeetCode Solution(Easy.29-32)

c/c++，python，for work

LeetCode Solution(Easy.25-28)

c/c++，python，for work

LeetCode Solution(Easy.21-24)

c/c++，python，for work

FEATURED TAGS

ABOUT ME

FRIENDS