题意：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->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.题目：给定一个有序链表，删除所有重复的节点，剩余都是原链表中的不相同的节点元素。比如，给定1->2->3->3->4->4->5 ，返回1->2->5.给定1->1->1->2->3 ，返回2->3.算法分析：设置前后双指针，...
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.You may imagine that num[-1] = num[n] = -∞.For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number...
【009-Palindrome Number（回文数）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Determine whether an integer is a palindrome. Do this without extra space. 题目大意 判断一个数字是否是回访字数，不要使用额外的空间。 解题思路 为了不使用额外的空间，参考了其它的解决，那些解法看起来在isPalindrome方法中没有使用额外参数，但是却使用了方法调用，这个比一个整数消耗的空间更多 ，并没有达到...
描述Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.分析无代码 1publicclass IntegerToRoman {2 3publicstaticvoid main(String[] args) {4// TODO Auto-generated method stub 5int num = 187;6 System.out.println(intToRoman(num));7 }8 9publicstatic String intToRoman(int num) {
10int radix[] = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9,...
1. 具体题目给定两个整数 n 和 k，你需要实现一个数组，这个数组包含从 1 到 n 的 n 个不同整数，同时满足以下条件：① 如果这个数组是 [a1, a2, a3, ... , an] ，那么数组 [|a1 - a2|, |a2 - a3|, |a3 - a4|, ... , |an-1 - an|] 中应该有且仅有 k 个不同整数；.② 如果存在多种答案，你只需实现并返回其中任意一种.示例 1: 输入: n = 3, k = 1 输出: [1, 2, 3] 解释: [1, 2, 3] 包含 3 个范围在 1-3 的不同整数， 并且 ...
Binary Tree Level Order Traversal IIGiven a binary tree, return the bottom-up level order traversal of its nodes‘ values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15,7}, 3/ 9 20/ 15 7
return its bottom-up level order traversal as:[[15,7],[9,20],[3]
]https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ 与...
转载请注明出处：z_zhaojun的博客
原文地址：http://blog.csdn.net/u012975705/article/details/50408975
题目地址：https://leetcode.com/problems/reverse-linked-list-ii/Reverse Linked List IIReverse a linked list from position m to n.Do it in-placeandin one-pass.For example:
Given 1->2->3->4->5->NULL, m =2and n =4,return1->4->3->2->5->NULL.Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ ...
题目描述题干：
给定一个非空特殊的二叉树，每个节点都是正数，并且每个节点的子节点数量只能为 2 或 0。
如果一个节点有两个子节点的话，那么该节点的值等于两个子节点中较小的一个。
更正式地说，root.val = min(root.left.val, root.right.val) 总成立。
给出这样的一个二叉树，你需要输出所有节点中的第二小的值。如果第二小的值不存在的话，输出 -1 。示例1：
输入：root = [2,2,5,null,null,5,7]
输出：5
解释：最小的值是 2...
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return[["aa","b"],["a","a","b"]
]
递归求解，没什么难度。publicclass Solution {List list = new ArrayList<ArrayList<String>>();char[] word ;String ss;String[] result;public List<List<String>> partition(String s) {int len = s.length();...
题目描述：You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called "bulls") and how many digits match the secret number but locate in the wrong pos...
Problem:
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
You may not alter the values in the nodes, only nodes itself may be changed.
Only constant memory is allowed.
For example,
Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2...
题目：https://leetcode-cn.com/problems/length-of-last-word/submissions/本题比较简单，只需从字符串的最后一个字符向前遍历即可，但是需要注意空格，不管末尾有多少个空格，从后向前遍历的时候从第一个非空格的字符开始计数，直到再次遇见空格，退出循环。 代码：class Solution {publicint lengthOfLastWord(String s) {if(s.length()==0) return 0;int sum=0,f=0; //sum用来记录最后一个单词长度，f用...
题目描述：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02):
The signature of the function had been updated to return the index instead of the pointer. If you still see your function signature returns a char * or String, please click the reload button to reset your code definition.
解题思路：从开头开始，...
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ‘s undirected graph serialization:
Nodes are labeled uniquely.We use # as a separator for each node, and , as a separator for node label and each neighbor of the node.
As an example, consider the serialized graph {0,1,2#1,2#2,2}.The graph has a total of three nodes, and therefore contains three parts...
题目：接雨水难度：hard题目内容：Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!Example:Input: [0,1,0,2,1,0,1,3...
