leetcode
shawnMMM
这个作者很懒,什么都没留下…
展开
-
【leetcode-7】Reverse Integer(C语言)
转自http://blog.csdn.net/zdavb/article/details/46839165问题描述: Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321这道题比较讨厌的地方在于如何判断溢出,好吧,我的方法比较low,因为我只会比较+法的溢出,,但是效果转载 2016-11-29 19:21:04 · 585 阅读 · 0 评论 -
[leetcode]21. Merge Two Sorted Lists(java)
题目描述: 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. 合并两个排序链表并返回一个新的列表。新的链表的结果由原先的两个链表结点组成,也就是不能合并后的链原创 2017-01-09 22:41:27 · 533 阅读 · 0 评论 -
[leetcode]88. Merge Sorted Array (java)
题目描述: 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.解题思路: 这是一道数组操作的题目,思路比较明确,就是维护三个数组,分别对应数组A,数组B,和结果数原创 2017-01-09 19:03:01 · 509 阅读 · 0 评论 -
[leetcode]38. Count and Say(java)
题目描述: The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, … 1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read原创 2017-01-09 14:19:02 · 711 阅读 · 0 评论 -
[leetcode]6. ZigZag Conversion
这个题我本人没想出来,所以参考了csdn大神的博客 本文转自:http://blog.csdn.net/zhouworld16/article/details/14121477题目要求:The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may转载 2017-01-08 21:30:03 · 273 阅读 · 0 评论 -
[Leetcode]Leetcode 27:Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The order原创 2016-12-31 14:13:46 · 293 阅读 · 0 评论 -
[Leetcode]LeetCode 19:Remove Nth Node From End of List
解题思路:一开始我的做法是先遍历一遍取得长度,然后长度减去n就知道要删除正着数第几个元素,结果没注意到题目要求one pass结果不行。那就只能用两个指针,一个快指针先走n步,一个慢指针从头开始走,这样当快指针走到尾部的时候,慢指针所指的就是要删除元素的前一个元素。 代码如下:/** * Definition for singly-linked list. * public class Lis原创 2016-12-31 11:50:29 · 249 阅读 · 0 评论 -
[leetcode]206. Reverse Linked List
题目描述: Reverse a singly linked list.解题思路:这个题有两种思路:递归和迭代,迭代相对于递归方式更加直观。 引入:算法中的自顶向下和自底向上 动态规划的实现分为两种,有递归和迭代。 递归一般是自顶向下,依赖于子问题优化函数的结果,只有子问题完全求出,也就是子问题的递归返回结果,原问题才能求解。 迭代法,就是巧妙的安排求解顺序,从最小的子原创 2017-01-08 11:03:11 · 289 阅读 · 0 评论 -
[leetcode]83. Remove Duplicates from Sorted List(java)
Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 解题思路: 设置两个指针一个no原创 2017-01-07 11:38:24 · 337 阅读 · 0 评论 -
[leetcode]26. Remove Duplicates from Sorted Array(java)
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原创 2017-01-06 22:49:02 · 335 阅读 · 0 评论 -
[leetcode]24. Swap Nodes in Pairs(java)
Given a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You may no原创 2017-01-06 21:22:06 · 345 阅读 · 0 评论 -
[leetcode]20. Valid Parentheses(java)
问题形容: 题目:有效括号 description: Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct orde原创 2017-01-06 13:47:54 · 414 阅读 · 0 评论 -
[leetcode]14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.写一个函数找到一个字符串数组中所有字符串最长的公共前缀想法:先通过获取所有字符串中最短的长度len,因为公共前缀长度肯定超不过最短的字符串的长度,简化运算步骤。然后暴力计算,每个字符串的第一位比较,一旦字符串数组中有两个字符串前缀原创 2016-12-01 14:42:45 · 274 阅读 · 0 评论 -
[leetcode]9. Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, note the re原创 2016-11-30 15:57:28 · 203 阅读 · 0 评论 -
LeetCode 8 String to Integer (atoi) (C,C++,Java,Python)
leetcode 8 String to Inter(atoi)(C,C++,Java,Python)转载 2016-11-30 10:14:13 · 278 阅读 · 0 评论 -
[leetcode]35. Search Insert Position(java)
问题描述Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.H原创 2017-02-03 16:09:54 · 460 阅读 · 0 评论