leetcode
燚涯
这个作者很懒,什么都没留下…
展开
-
Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.You原创 2015-07-26 21:09:07 · 318 阅读 · 0 评论 -
Implement strStr()
即:自己实现strstr()函数 Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.解题思路: 求出两个函数的长度差值,即返回值index的取值范围int strStr(char* haystack,原创 2015-07-23 22:55:03 · 184 阅读 · 0 评论 -
Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.解题思路: (1)定义两个大小为2数组,一个为temp[2]存储元素,一个为times[2]存储次数 (原创 2015-08-05 16:58:16 · 322 阅读 · 0 评论 -
Ugly Number II
Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly原创 2015-09-05 18:46:26 · 299 阅读 · 0 评论 -
Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are原创 2015-09-05 22:21:58 · 301 阅读 · 0 评论 -
Ugly Number
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it in原创 2015-09-05 16:39:27 · 309 阅读 · 0 评论 -
Pascal's Triangle II
Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extra space?int* getRow(int rowIndex,原创 2015-09-25 10:29:29 · 420 阅读 · 0 评论 -
Pascal's Triangle
Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]int** generate(int numRows, int原创 2015-09-24 22:32:58 · 398 阅读 · 0 评论 -
House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses原创 2015-09-07 21:25:51 · 68 阅读 · 0 评论 -
Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra me原创 2015-09-13 11:08:48 · 250 阅读 · 0 评论 -
Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using ex原创 2015-09-13 11:10:01 · 347 阅读 · 0 评论 -
Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given nums = [1,原创 2015-09-13 16:36:59 · 241 阅读 · 0 评论 -
Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.解题思路: (1)重新分配一个数组,大小为digitsS原创 2015-07-22 21:23:25 · 336 阅读 · 0 评论 -
Sort List
Sort a linked list in O(n log n) time using constant space complexity.解题思路: (1)将链表中的值依次取出存在一个数组中 (2)对数组进行希尔排序 (3)将排序后的元素放回链表中struct ListNode* sortList(struct ListNode* head) {struct ListNode* head1原创 2015-07-21 22:07:23 · 273 阅读 · 0 评论 -
Reverse Linked List
给定一个链表:1->2->3->NULL 反转后为:3->2->1->NULL;struct ListNode* reverseList(struct ListNode* head) { struct ListNode* pNode = head; struct ListNode* PreNode = NULL; struct ListNode* NewHead =原创 2015-07-21 21:32:00 · 298 阅读 · 0 评论 -
Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two原创 2015-07-26 22:34:54 · 179 阅读 · 0 评论 -
Reorder List
Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes’ values.For example, Given {1,2,3,4}, reorder it to {1,4,2,3}原创 2015-08-09 13:42:42 · 300 阅读 · 0 评论 -
Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up: Can you solve it without using extra space?解题思路: (1)用快慢指针原创 2015-08-25 10:41:47 · 279 阅读 · 0 评论 -
Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the原创 2015-08-25 11:57:11 · 275 阅读 · 0 评论 -
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 exactly原创 2015-07-19 22:48:19 · 421 阅读 · 0 评论 -
Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where in原创 2015-07-19 23:18:11 · 252 阅读 · 0 评论 -
4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note: Elements in a quad原创 2015-07-20 15:45:30 · 324 阅读 · 0 评论 -
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-07-20 13:40:01 · 411 阅读 · 0 评论 -
Largest Number
Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result may be very large,原创 2015-07-21 11:48:57 · 296 阅读 · 0 评论 -
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)).解题思路: 先求出两个数组元素个数之和numsSize,则原创 2015-08-27 20:22:27 · 310 阅读 · 0 评论 -
Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->6->NULL, m = 2 and n = 5, return 1->5->4->3->2->6->NULL. Note: Given m, n satisfy the原创 2015-07-21 21:28:55 · 246 阅读 · 0 评论 -
Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.char* multiply(char* num1, char* num2) {//获取字符原创 2015-09-15 16:50:54 · 263 阅读 · 0 评论