喜欢反对

/*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 o

/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } *//* * key t

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link

Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.Idea: dummy node    1.find leng

Problem: Sort a linked list using insertion sort.public class Solution { public ListNode insertionSortList(ListNode head) { if(head==null || head.next==null) return head;

The key of this problem is to locate the node prior the removing node:There are two ways to locate

/*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

/*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.*//** * Definition for singly-linked list. * publ

/*Remove Duplicates from Sorted List II :Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->

The question was asked in Google phone interview

/*Remove Duplicates from Sorted List:Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return

/*Linked List Cycle Total Accepted: 22080 Total Submissions: 62658 My SubmissionsGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?*/

/*Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?*//** * Definition for singly-linked list.

/* * Key to solve: Since it require to sort input lists, and merge together, * then output one. We can use the DataStructure of PriorityQueue that * sorting elements during insert operation. The

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ /*Key

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key i

/*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 foll