LeetCode
二货磁铁
这个作者很懒,什么都没留下…
展开
-
OJ 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 array is non-empty and the majority eleme原创 2015-03-24 15:44:20 · 374 阅读 · 0 评论 -
OJ_191 Number of 1 Bits
LeetCode上面的191号题目原创 2015-03-25 22:33:31 · 405 阅读 · 0 评论 -
OJ 19 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.原创 2015-03-26 11:05:46 · 412 阅读 · 0 评论 -
OJ172
题目要求:Given an integer n, return the number of trailing zeroes in n!. 我的解法: int trailingZeroes(int n) { if(n>=5) { int k = n/5; return k+trailingZeroes(k); } else原创 2015-03-24 15:40:38 · 298 阅读 · 0 评论 -
OJ 199 Binary Tree Side View
LeetCode上面的第199题原创 2015-04-12 11:32:34 · 453 阅读 · 0 评论 -
OJ 002 Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linke原创 2015-04-09 16:23:52 · 364 阅读 · 0 评论