leetcode
这是本人刷leetcode的一点记录,希望对大家有所帮助
HelloWorld_EE
这个作者很懒,什么都没留下…
展开
-
《leetCode》:3Sum Closest
题目Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactl原创 2015-11-03 20:16:20 · 691 阅读 · 0 评论 -
《leetCode》:3Sum
题目Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c) must be原创 2015-11-03 19:52:14 · 1324 阅读 · 0 评论 -
《leetCode》:Merge Two Sorted Lists
题目Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.思想比较简单:利用两个指针遍历两个链表,并比较将较小的值进行保存。/** * Definition for sin原创 2015-11-02 22:28:46 · 643 阅读 · 0 评论 -
《leetCode》: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. After removing the second node from the end, the link原创 2015-11-02 20:53:18 · 581 阅读 · 0 评论 -
《leetCode》:Remove Duplicates from Sorted Array II
题目描述Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five elem原创 2015-11-02 19:07:14 · 643 阅读 · 0 评论 -
《leetCode》:Remove Duplicates from Sorted Array
题目描述Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2015-11-02 18:58:51 · 583 阅读 · 0 评论 -
《leetCode》:Longest Common Prefix
题目描述 Write a function to find the longest common prefix string amongst an array of strings. 大意就是寻找字符串数组中所有字符的最大公共子串。思路比较简单:就是通过遍历来判断是否所有字符均相同。 实现代码如下:int findMinStrLen(char **strs,int strsSize){原创 2015-11-01 17:35:29 · 603 阅读 · 0 评论 -
《leetCode》:Integer to Roman
题目描述Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.思路由于罗马数字就是由”个“”十“、”百“拼凑而来。因此我们只需要将下面几张表存储起来,然后查表即可【罗马数字】1~9: {"I", "II", "III", "IV", "V",原创 2015-11-01 16:49:58 · 573 阅读 · 0 评论 -
《leetCode》:Roman to integer
题目描述Roman to integer罗马数字介绍基本字符 I V X L C D M相应的阿拉伯数字表示为 1 5 10 50 100 500 10001、相同的数字连写、所表示的数等于这些数字相加得到的数、如:Ⅲ=3;2、小的数字在大的数字的右边、所表示的数等于这些数字相加得到的数、 如:Ⅷ=8、Ⅻ=12;3、小的数字、(限于 Ⅰ、X 和 C)在大的数字的左边、所表示的数等于原创 2015-11-01 15:35:23 · 548 阅读 · 0 评论 -
《leetCode》:palindrome Number
题目描述Determine whether an integer is a palindrome. Do this without extra space.题目大意:即检测一个数是否为回文数,不开辟额外的空间思路比较简单 第一步:统计x的长度。 第二步:比较x的最高位和最低位是否相等 第三步:如果第二步的结果相等,则将x的最高位和最低位的数字去掉变为新的x,重复第一步和第二步即可。原创 2015-10-31 22:37:15 · 680 阅读 · 1 评论 -
《leetCode》:Convert 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 and ask yourself what are the possible input cas原创 2015-10-31 21:33:28 · 1014 阅读 · 0 评论 -
《leetCode》:Reverse Integer
题目描述:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321实现代码如下:#include<stdio.h>#include<stdlib.h>int reverse(int x) { long result=0;//这里设为long型,是为后面检查是否溢出in原创 2015-10-31 19:01:36 · 657 阅读 · 0 评论 -
《leetCode》:ZigZag Conversion
关于ZigZag的理解/*1、第i排从i开始2、 含numRows的每列相邻之间的元素的间隔为step=2*(numRows-1) 3、斜线上面的元素间隔为:step=j+step-2*i;其中j为s中的下标,i为行下标(从零开始) */ #include<stdio.h>#include<stdlib.h>#include<string.h> char* convert(char* s原创 2015-10-31 17:21:16 · 580 阅读 · 0 评论 -
《leetCode》:Longest Substring Without Repeating Characters
题目描述如下:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is原创 2015-10-31 14:25:16 · 596 阅读 · 0 评论 -
《leetCode》:add two num
题目描述如下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原创 2015-10-29 22:37:41 · 823 阅读 · 0 评论 -
《LeetCode》:Two Sum
《LeetCode》:Two Sum昨天刚说的准备去刷《程序员面试金典》上面的题,但是看了下那本书上面的题,感觉都没有什么意思,因此也就打算来刷了leetCode上面的题了。刷题的顺序选择了按照顺序来刷。今天开始了第一题:Two Sum 题目如下: 意思就是:在一个整型数组中,寻找两个数等于一个定值,返回这个数在数组中的下标,要注意的是:下标不是从0开始的。《剑指Offer》上也有类似原创 2015-10-29 20:40:10 · 730 阅读 · 0 评论