abc_begin

导航

2017年12月30日 #

655. Big Integer Addition【easy】

摘要: Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2. Notice The length of both num1 and num2 is < 510 阅读全文

posted @ 2017-12-30 21:44 LastBattle 阅读(122) 评论(0) 推荐(0)

221. Add Two Numbers II【medium】

摘要: You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in forward order, such that the 1's 阅读全文

posted @ 2017-12-30 21:21 LastBattle 阅读(157) 评论(0) 推荐(0)

167. Add Two Numbers【easy】

摘要: You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's 阅读全文

posted @ 2017-12-30 21:02 LastBattle 阅读(158) 评论(0) 推荐(0)

544. Top k Largest Numbers【medium】

摘要: Given an integer array, find the top k largest numbers in it. Given an integer array, find the top k largest numbers in it. Example Given [3,10,1000,- 阅读全文

posted @ 2017-12-30 20:39 LastBattle 阅读(134) 评论(0) 推荐(0)

413. Reverse Integer【easy】

摘要: Reverse digits of an integer. Returns 0 when the reversed integer overflows (signed 32-bit integer). Reverse digits of an integer. Returns 0 when the 阅读全文

posted @ 2017-12-30 18:38 LastBattle 阅读(128) 评论(0) 推荐(0)

219. Insert Node in Sorted Linked List【Naive】

摘要: Insert a node in a sorted linked list. Insert a node in a sorted linked list. Example Given list = 1->4->6->8 and val = 5. Return 1->4->5->6->8. 解法一: 阅读全文

posted @ 2017-12-30 18:00 LastBattle 阅读(337) 评论(0) 推荐(0)

150. Best Time to Buy and Sell Stock II【medium】

摘要: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

posted @ 2017-12-30 17:30 LastBattle 阅读(112) 评论(0) 推荐(0)

213. String Compression【easy】

摘要: Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2b1c 阅读全文

posted @ 2017-12-30 17:12 LastBattle 阅读(252) 评论(0) 推荐(0)

495. Implement Stack【easy】

摘要: Implement a stack. You can use any data structure inside a stack except stack itself to implement it. Implement a stack. You can use any data structur 阅读全文

posted @ 2017-12-30 16:52 LastBattle 阅读(211) 评论(0) 推荐(0)

547. Intersection of Two Arrays【easy】

摘要: Given two arrays, write a function to compute their intersection. Notice Each element in the result must be unique. The result can be in any order. Gi 阅读全文

posted @ 2017-12-30 16:19 LastBattle 阅读(186) 评论(0) 推荐(0)