卷毛的博客

Given a linked list, remove the nth node from the end of list and return its head.题目大意：给定一个链表，删除它倒数第n位的节点并重新返回此链表博主想到的方法比较简单，先遍历一次求出链表的长度，确定是正数第几个节点被删除，然后二次遍历删除它方法一：class Solution { publ

二分查找二维数组

动态规划

Jump Game

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keysless than the node's key.The

Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as yo

Write a program tofind the node at which the intersection of two singly linked lists begins. Notes:If the two linked lists have no intersection at all, return null.The linked lists must reta

一道经典的面试题，找出数组中出现半数以上的元素（不包含半数）。先贴代码：public int majorityElement(int[] nums) { int result = 0,count = 0; for(int i = 0;i < nums.length;i ++){ if(count == 0){

1.4 字符串题目要求：按EXCEL的序A~Z，AA~ZZ,...将给定正整数转化为此序列i.e: 1 .....  A,2.....B,26......Z,27.......AA.public String convertToTitle(int n) { String ret = ""; while(n > 0)

Given a list, rotate the list to the right by k places, where k is non-negativeExample:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.这道题是我做的比较满意的，因为用到了经验，说一下我自己的解法：大众

The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If foun

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1-&gt;2-&gt;3-&gt;3-&gt;4-&gt;4-&gt;5, return 1-&gt;2-&...