leetCode
麦田的香
这个作者很懒,什么都没留下…
展开
-
Leet Code OJ 1. Two Sum [Difficulty: Easy]
题目: Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example: Given nums原创 2017-08-19 21:57:43 · 194 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Note:The input is assumed to be a 32-bit signed integer. Your function should原创 2017-08-21 17:00:17 · 142 阅读 · 0 评论 -
Add_TwoNumbers的理解和应用
花了一个星期理解了这段代码,add_two_numberspublic static void calculateSum(ListNode tresult, ref int carry, int sum) { if (sum >= 10) { carry = 1;翻译 2017-08-29 09:41:28 · 412 阅读 · 0 评论