elmagnifico's blog

LeetCode Solution(Medium.9-12)

c/c++，python，for work

9.Search Insert Position Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume ...

Posted on December 19, 2015; Words: 3164

LeetCode Solution(Medium.5-8)

c/c++，python，for work

5.Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]....

Posted on December 18, 2015; Words: 958

LeetCode Solution(Medium.1-4)

c/c++，python，for work

前言从本篇开始，做所有Medium难度的题目 1.Single Number Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexit...

Posted on December 17, 2015; Words: 2403

LeetCode Solution(Easy.65-68)

c/c++，python，for work

65.Excel Sheet Column Title Given a positive integer, return its corresponding column title as appear in an Excel sheet. For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 ...

Posted on December 16, 2015; Words: 2841

LeetCode Solution(Easy.61-64)

c/c++，python，for work

61.Count Primes Description: Count the number of prime numbers less than a non-negative number, n. Credits: Special thanks to @mithmatt for adding this problem and creating all test cases. Hin...

Posted on December 16, 2015; Words: 2767

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: 3198

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: 1871

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: 1784

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: 2283

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: 1906

Elmagnifico's Blog

LeetCode Solution(Medium.9-12)

c/c++，python，for work

LeetCode Solution(Medium.5-8)

c/c++，python，for work

LeetCode Solution(Medium.1-4)

c/c++，python，for work

LeetCode Solution(Easy.65-68)

c/c++，python，for work

LeetCode Solution(Easy.61-64)

c/c++，python，for work

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

FEATURED TAGS

ABOUT ME

FRIENDS