算法
文章平均质量分 50
一的三次方
这个作者很懒,什么都没留下…
展开
-
不用sqrt()函数,如何求平方根
1,牛顿迭代法牛顿法的作用是使用迭代的方法来求解函数方程的根。简单地说,牛顿法就是不断求取切线的过程。他可以快速求出平方根的近似值。例如,我们想求n的平方根(n>0),他的标准值是x.f(x)=x^2-n 就是这个函数与x轴交点出的正值就是所求x。首先随便猜一个近似值x,然后不断令x等于x和a/x的平均数,迭代个六七次后x的值就已经相当精确了。我们不断用过翻译 2015-06-26 17:34:11 · 3124 阅读 · 0 评论 -
Leetcode|【4】Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).这题不简单,通用的方法是写出一个找到两个数组第K大的函数。这原创 2015-09-08 19:25:09 · 366 阅读 · 0 评论 -
Leetcode|Longest Palindromic Substring(最长回文的几种方法)(Manacher算法)
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.解法1:枚举法 O(n^2)时间复杂原创 2015-08-30 12:03:12 · 450 阅读 · 0 评论 -
Leetcode|Combination Sum II[递归回溯]
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.No原创 2015-08-02 20:26:47 · 325 阅读 · 0 评论 -
Leetcode|Combination Sum III[回溯]
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Ensure that numbers within原创 2015-08-02 20:34:50 · 343 阅读 · 0 评论 -
Leetcode|Find Minimum 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).Find the minimum element.You may assume no duplicate exists in the array.参考lee原创 2015-08-01 17:12:57 · 260 阅读 · 0 评论 -
Leetcode|Find Minimum in Rotated Sorted Array II(有重复元素的二分查找)
Follow up for “Find Minimum in Rotated Sorted Array”: What if duplicates are allowed?Would this affect the run-time complexity? How and why? Suppose a sorted array is rotated at some pivot unknown to原创 2015-08-01 17:15:34 · 250 阅读 · 0 评论 -
Leetcode|Pow(x,n)
Implement pow(x, n). x是double类型,n是int类型;边界条件:x==0和n==0 n为负数: 结尾取个倒数即可 效率问题: 解法1:一个一个乘,肯定超时。 解法2:用2的m次方和n比较。因为n可以表示成2的m次方的多项式相加的形式。 问题是:表示2的n次方(用移位表示),1<<30是(INT_MAX/2) ,1<<31 就是INT_MIN。 但是n==INT原创 2015-08-10 16:45:02 · 395 阅读 · 0 评论 -
Leetcode|Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.Example 1 Input:原创 2015-08-08 13:29:32 · 263 阅读 · 0 评论 -
位操作的技巧
一,基本概念认知 1,为啥要用补码 计算机中的符号数有三种表示方法,即原码、反码和补码。三种表示方法均有符号位和数值位两部分,符号位都是用0表示“正”,用1表示“负”,而数值位,三种表示方法各不相同。 在计算机系统中,数值一律用补码来表示和存储。原因在于,使用补码,可以将符号位和数值域统一处理;同时,加法和减法也可以统一处理。此外,补码与原码相互转换,其运算过程是相同的,不需要额外的硬件电路。原创 2015-07-06 18:54:35 · 490 阅读 · 0 评论 -
Leetcode|Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least one candy.原创 2015-07-03 09:42:26 · 283 阅读 · 0 评论 -
Leetcode|Surrounded Regions
Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’.A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region.For example, X X X X X O O X X X O X X O原创 2015-07-02 11:08:33 · 213 阅读 · 0 评论 -
Leetcode|Maximum Gap
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains less than 2 elements原创 2015-06-29 10:01:39 · 311 阅读 · 0 评论 -
编程珠玑 | 如何给磁盘文件排序
第一章输入:文件最多包含10,000,000 条记录,无重复记录,每条记录是一个7位电话号码(2773889)输出:升序排列的输入蒸熟的列表约束:最多1MB的内存空间可用,充足的磁盘存储空间;运行时间最多几分钟,最好10s内; 方法1. 归并排序:输入文件读取一次,读写中间帮助文件多次2. 多次遍历排序,根据整数特点排序,每个号码可以用32bit的整数表示,1MB内存可...原创 2018-12-18 08:34:43 · 482 阅读 · 0 评论