problem 707. Design Linked List 参考 1. Leetcode_easy_707. Design Linked List; 完…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 日期 题目地址:https://leetcode.com/problems/design-linked-list/description/ 题目描述 Design your implementation of the linked list. You can choose to use the singly linked list or the do…

problem 706. Design HashMap solution1: class MyHashMap { public: /** Initialize your data structure here. */ MyHashMap() { data.resize(, -);//errr... } /** value will always be non-negative. */ void put(int key, int value) { data[key] = value; } /**…

problem 705. Design HashSet 题意: solution1: class MyHashSet { public: /** Initialize your data structure here. */ MyHashSet() { data.resize(, ); } void add(int key) { data[key] = ; } void remove(int key) { data[key] = ; } /** Returns true if this set…

转自:http://mrfufufu.github.io/android/2015/07/01/Codelab_Android_Design_Support_Library.html [翻]Android Design Support Library 的 代码实验——几行代码,让你的 APP 变得花俏 Jul 1, 2015 译者地址:[翻]Android Design Support Library 的 代码实验——几行代码,让你的 APP 变得花俏 原文:Codelab for Androi…

problem 876. Middle of the Linked List 参考 1. Leetcode_easy_876. Middle of the Linked List; 完…

1. 原始题目 Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is …

https://leetcode.com/problems/design-linked-list/ Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is t…

题目:Reverse Linked List II 题意:Reverse a linked list from position m to n. Do it in-place and in one-pass. 下面这段代码,有两个地方,一个是4.5行的dummy节点设置:另一个是11-14行,局部可视化到全局. ListNode *reverseBetween(ListNode *head, int m, int n) { if(m == n) return head; n -= m; List…

题目描述: Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in the user's news feed. Your design should support the following methods: postTweet(userId, tweetId):…

题目: Reverse a singly linked list. 提示: 此题不难,可以用迭代或者递归两种方法求解.记得要把原来的链表头的next置为NULL: 代码: 迭代: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { pub…

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->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note:Given m, n satisfy the following condition:1 ≤ m ≤ n ≤ lengt…

234. Palindrome Linked List 1. 使用快慢指针找中点的原理是fast和slow两个指针,每次快指针走两步,慢指针走一步,等快指针走完时,慢指针的位置就是中点.如果是偶数个数,正好是一半一半,如果是奇数个数,慢指针正好在中间位置,判断回文的时候不需要比较该位置数据. 注意好好理解快慢指针的算法原理及应用. 2. 每次慢指针走一步,都把值存入栈中,等到达中点时,链表的前半段都存入栈中了,由于栈的后进先出的性质,就可以和后半段链表按照回文对应的顺序比较. solution…

Palindrome Linked List Given a singly linked list, determine if it is a palindrome. Follow up:Could you do it in O(n) time and O(1) space? 解法一: 一次遍历,装入vector,然后再一次遍历判断回文. 时间复杂度O(n),空间复杂度O(n) /** * Definition for singly-linked list. * struct ListNode…

Reverse Linked List Reverse a singly linked list. click to show more hints. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both? 解法一:非递归 /** * Definition for singly-linked list. * struct ListNode { * int va…

Remove Linked List Elements Remove all elements from a linked list of integers that have value val. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5 Credits:Special thanks to @mith…

题目: 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 place. The program should run in O(1) space comp…

Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts". The length of each part should be as equal as possible: no two parts should have a size differing by more than 1.…

题目: Reverse a linked list from position m to n. Given m, n satisfy the following condition: 1 ≤ m ≤ n ≤ length of list. Example Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. 题解: Solution 1 () class S…

题目: Reverse a linked list. Example For linked list 1->2->3, the reversed linked list is 3->2->1 题解: Solution 1 () class Solution { public: ListNode *reverse(ListNode *head) { if (!head) { return head; } ListNode *prev = nullptr; while (head) {…

我非常喜欢Material Design里折叠工具栏的效果,bilibili Android客户端视频详情页就是采用的这种设计.这篇文章的第二部分我们就通过简单的模仿bilibili视频详情页的实现来了解下CollapsingToolbarLayout的使用.文章的第三部分介绍了CollapsingToolbarLayout与TabLayout的组合使用. 有基础的朋友可以直接跳过第一部分. 一.相关基础属性介绍 Android studio中有一个Activity模板叫ScrollingAct…

题目如下: Design a Leaderboard class, which has 3 functions: addScore(playerId, score): Update the leaderboard by adding score to the given player's score. If there is no player with such id in the leaderboard, add him to the leaderboard with the given s…

题目如下: Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to…

题目标签:Linked List 题目让我们自己设计一个 linked list,可以是单向和双向的.这里选的是单向,题目并不是很难,但要考虑到所有的情况,具体看code. Java Solution: Runtime:  56 ms, faster than 21.21% Memory Usage: 45.2 MB, less than 88.89% 完成日期:07/08/2019 关键点:edge cases public class ListNode { int val; ListNode…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 字典 日期 题目地址:https://leetcode-cn.com/problems/design-hit-counter/ 题目描述 Design a hit counter which counts the number of hits received in the past 5 minutes. Each function accepts a…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 字典 目录树 日期 题目地址https://leetcode-cn.com/problems/design-file-system/ 题目描述 You are asked to design a file system which provides two functions: create(path, value): Creates a new pa…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 数组 日期 题目地址:https://leetcode-cn.com/problems/design-phone-directory/ 题目描述 Design a Phone Directory which supports the following operations: get: Provide a number which is not ass…

作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 维护当前字符和次数 日期 题目地址:https://leetcode-cn.com/problems/design-compressed-string-iterator/ 题目描述 Design and implement a data structure for a compressed string iterator. It should supp…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 迭代 递归 日期 [LeetCode] 题目地址:https://leetcode.com/problems/reverse-linked-list/ Total Accepted: 105474 Total Submissions: 267077 Difficulty: Easy 题目描述 Reverse a singly linked list.…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 双指针 递归 日期 题目地址:https://leetcode.com/problems/remove-linked-list-elements/description/ 题目描述 Remove all elements from a linked list of integers that have value val. Example Given…