Leetcode
Gawing_
这个作者很懒,什么都没留下…
展开
-
206. Reverse Linked List
Reverse a singly linked list. 递归与指针实现代码贴上#include struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; class Solution { public: ListNode* reverse原创 2016-09-21 20:27:19 · 150 阅读 · 0 评论 -
167. Two Sum II - Input array is sorted
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two number原创 2016-09-29 15:41:40 · 157 阅读 · 0 评论 -
389. Find the Difference
Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random position. Find the letter that was原创 2016-09-29 14:56:30 · 149 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. int maxDepth(struct TreeNode* root原创 2016-09-28 22:21:56 · 152 阅读 · 0 评论 -
258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on原创 2016-09-28 22:07:55 · 173 阅读 · 0 评论 -
136. 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 e原创 2016-09-28 21:45:03 · 165 阅读 · 0 评论 -
371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. int getSum(int a, int b) { int result = a ^ b;原创 2016-09-27 22:37:32 · 158 阅读 · 0 评论 -
292. Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the原创 2016-09-27 21:35:01 · 136 阅读 · 0 评论 -
338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array. Example: For num = 5原创 2016-09-27 21:24:13 · 148 阅读 · 0 评论 -
21. 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. struct ListNode* mergeTwoLists(struct ListNode* l1, str原创 2016-09-26 22:26:56 · 163 阅读 · 0 评论 -
24. Swap Nodes in Pairs
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. Y原创 2016-09-26 22:25:39 · 128 阅读 · 0 评论 -
141. Linked List Cycle
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 快慢指针,但不额外占用空间的方法没找到。 /** * Definition for singly-linked list. * struct ListNode原创 2016-09-26 22:22:39 · 161 阅读 · 0 评论 -
83. Remove Duplicates from Sorted List
For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 开始的时候想着还要free啥的,结果超时,果断去掉free,AC。。 有一点需要注意,链表中有连续两个以上重复元素的处理方式。 代码贴上 /** * Definition for singly-linked list.原创 2016-09-21 23:00:52 · 144 阅读 · 0 评论 -
328. Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes. You should try to do it in原创 2016-09-21 22:20:06 · 140 阅读 · 0 评论 -
226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max Howe原创 2016-09-29 15:47:25 · 165 阅读 · 0 评论