OJ
文章平均质量分 53
Yetongfff
这个作者很懒,什么都没留下…
展开
-
LeetCode 390. Elimination Game
There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach the end of the list. Repeat the previous step ag原创 2017-04-12 18:17:36 · 936 阅读 · 0 评论 -
Summary for LeetCode 2Sum, 3Sum, 4Sum, K Sum
Summary for LeetCode 2Sum, 3Sum, 4Sum, K SumOverviewI summarize various solutions (sort, hash, etc) for the leetcode 2Sum, 3Sum, 4Sum problems as well as how to optimize and some importa转载 2016-03-05 16:05:18 · 667 阅读 · 0 评论 -
[LeetCode]Delete Digits
题目 Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to the original order to become a new positive i原创 2016-06-28 21:47:07 · 365 阅读 · 0 评论 -
LeetCode: Find Peak Element
A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and return its index. The array may contain multiple peaks,原创 2016-03-10 14:58:39 · 282 阅读 · 0 评论 -
Leetcode Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the array retu原创 2016-03-09 11:26:19 · 381 阅读 · 0 评论 -
leetcode 202 Happy Number
202. Happy NumberWrite an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by原创 2016-02-23 18:51:21 · 441 阅读 · 0 评论 -
LeetCode Majority Element
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 m原创 2015-11-09 14:00:04 · 397 阅读 · 0 评论 -
九度OJ1389剑指offer面试题9变形:变态跳台阶
题目描述一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。 输入输入可能包含多个测试样例,对于每个测试案例, 输入包括一个整数n(1<=n<=50)。 输出对应每个测试案例, 输出该青蛙跳上一个n级的台阶总共有多少种跳法。 样例输入6 样例输出32解题思路假设要求的跳上n级台阶有多少种方法为f(n),由于青蛙可原创 2015-07-17 12:01:31 · 614 阅读 · 0 评论 -
九度OJ1386剑指offer面试题8:旋转数组的最小数字
九度OJ1386剑指offer面试题8:旋转数组的最小数字 题目描述把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。输入一个递增排序的数组的一个旋转,输出旋转数组的最小元素。例如数组{3,4,5,1,2}为{1,2,3,4,5}的一个旋转,该数组的最小值为1。 输入输入可能包含多个测试样例,对于每个测试案例,输入的第一行为一个整数n(1<= n<=1000000):代表原创 2015-07-16 20:41:57 · 514 阅读 · 0 评论 -
reference counter 引用计数器
◆内存管理容易出现的问题memory leak(内存泄漏):不需要的内存领域没有释放。dangling pointer(空指针):参照已经释放的内存领域。◆Objective-C的内存管理机制reference counter : Objective-C 1.0~garbage collection : Objective-C 2.0~◆reference coun转载 2015-01-17 21:12:58 · 795 阅读 · 0 评论 -
卡特兰数介绍及其应用
卡特兰数卡特兰数又称卡塔兰数,英文名Catalan number,是组合数学中一个常出现在各种计数问题中出现的数列。以比利时的数学家欧仁·查理·卡塔兰 (1814–1894)的名字来命名,其前几项为 : 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786…… 其递推式: h(n)=h(0)∗h(n−1)+h(1)∗h(n−2)+...+h(原创 2017-02-12 16:25:10 · 1026 阅读 · 0 评论