far away

61. Rotate ListGiven a list, rotate the list to the right by k places, where k is non-negative.Example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.//如果k大于链表长度时，应

56. Merge IntervalsGiven a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].//不明白排序函数为什么要写成静态的/** *

51. N-QueensThe n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the

46. PermutationsGiven a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1],

41. First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run

36. Valid SudokuDetermine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.

31. Next PermutationImplement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearran

26. Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space

21. Merge Two Sorted ListsMerge 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.Example:Input: 1->2

16. 3Sum ClosestGiven an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each

11. Container With Most WaterGiven n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of l

6. ZigZag ConversionThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibil

最近开始刷Leetcode了，大三狗还没有找到实习，很菜啊，希望明年三月份能找份实习工作吧！2017年最后一篇博客，明天都元旦了，提前对大家说元旦快乐哈！下面所有代码在我GitHub上也有，地址：https://github.com/zzuliLL/Leetcode-1. Two SumGiven an array of integers, return indices o

题目链接：https://www.nowcoder.com/acm/contest/40/B时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 131072K，其他语言262144K64bit IO Format: %lld题目描述珂朵莉给你一个有根树，求有多少个子树满足其内部节点编号在值域上连续一些数在值域上连续的意思即其在值

最近自学的python基础，刚看了一些socket（套接字）编程，写了一个简单的通讯软件，分为客户端和服务器，在同一台主机或者两台不同的主机间的通信代码：# Clientimport sockets=socket.socket(socket.AF_INET,socket.SOCK_STREAM)s.connect(("172.20.204.130",8888)) # 目的服务器

题目链接：https://www.nowcoder.com/acm/contest/35/C时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述有一块n*m的地，每块地要么长满杂草(用'W'表示)，要么是空地(用'G'表示)，现在有一个人站在(1,1)，面向

题目链接：https://www.nowcoder.com/acm/contest/35/A时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述给出n个整数和x，请问这n个整数中是否存在三个数a，b，c使得ax2+bx+c=0，数字可以重复使用。输入描述:

题目链接：https://www.nowcoder.com/acm/contest/26/D时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 65536K，其他语言131072K64bit IO Format: %lld题目描述我永远喜欢珂朵莉~！有两个长为n的序列a[i]与b[i]你可以把任意不多于x个a序列中的数变

题目链接：https://www.nowcoder.com/acm/contest/26/A题目描述有n只猴子，第i只猴子每过xi小时会连续吃香蕉yi小时。猴子从第二次开始每次休息结束后这只猴子连续吃香蕉的时间会增加zi小时。给定n只猴子，每一只的xi，yi，zi，以及时间t，求在前t小时中，所有猴子共吃了多少小时。 对于一只猴子来说是这样的：从第1小时开始

题目链接：http://hihocoder.com/problemset/problem/1620解析：维护一棵树，树根里面存（没有找到第一个大于该值的）最小值的编号，一直维护就好了，借鉴大佬得100分的代码代码：#include<stdio.h>#include<algorithm>#include<string.h>#include<queue>using namespace std;t