随笔分类 -  LeetCode

LeetCode刷题之路
LeetCode206:Reverse Linked List
摘要：Reverse a singly linked list. 分别用迭代和递归实现 迭代实现： 递归实现： 1）如果head为空，或者只有head这一个节点，return head即可； 2）先遍历head->next为首的链表，得到一个头结点newHead； 3）把head赋值给head->next 阅读全文
posted @ 2016-04-29 16:13 EvansYang 阅读(123) 评论(0) 推荐(0)
LeetCode 169. Majority Element
摘要：Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文
posted @ 2016-04-28 15:30 EvansYang 阅读(108) 评论(0) 推荐(0)
LeetCode171:Excel Sheet Column Number
摘要：Related to question Excel Sheet Column Title Given a column title as appear in an Excel sheet, return its corresponding column number. For example: A 阅读全文
posted @ 2016-03-05 11:09 EvansYang 阅读(130) 评论(0) 推荐(0)
LeetCode242:Valid Anagram
摘要：Given two strings s and t, write a function to determine if t is an anagram of s. For example,s = "anagram", t = "nagaram", return true.s = "rat", t = 阅读全文
posted @ 2016-03-04 09:43 EvansYang 阅读(144) 评论(0) 推荐(0)
LeetCood8:String to Integer
摘要：Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below 阅读全文
posted @ 2016-03-04 09:16 EvansYang 阅读(199) 评论(0) 推荐(0)
LeetCode100:Same Tree
摘要：Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a 阅读全文
posted @ 2016-03-03 09:58 EvansYang 阅读(118) 评论(0) 推荐(0)
LeetCode283:Move Zeros
摘要：Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, giv 阅读全文
posted @ 2016-03-03 01:01 EvansYang 阅读(145) 评论(0) 推荐(0)
Leetcode226：Invert Binary Tree
摘要：Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 /** * Definition for a binary tree node. * struct TreeNode { * int val; * 阅读全文
posted @ 2016-03-02 21:03 EvansYang 阅读(171) 评论(0) 推荐(0)
LeetCode258:Add Digits
摘要：Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 阅读全文
posted @ 2016-03-02 20:36 EvansYang 阅读(130) 评论(0) 推荐(0)
Leetcode237：Delete Node in a Linked List
摘要：Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 - 阅读全文
posted @ 2016-03-02 19:50 EvansYang 阅读(127) 评论(0) 推荐(0)
LeetCode7:Reverse Integer
摘要：Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here a 阅读全文
posted @ 2016-03-02 15:06 EvansYang 阅读(104) 评论(0) 推荐(0)
LeetCode292:Nim Game
摘要：You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 ston 阅读全文
posted @ 2016-03-02 15:02 EvansYang 阅读(122) 评论(0) 推荐(0)
LeetCode104: Maximum Depth of Binary Tree
摘要：Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2016-03-02 15:00 EvansYang 阅读(131) 评论(0) 推荐(0)