LeetCode
清新哥哥
暴走牛牛
展开
-
Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a posi原创 2018-03-30 19:02:55 · 1573 阅读 · 0 评论 -
求一个数组的众数----------Majority Element169
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element alwa...原创 2018-07-28 20:29:02 · 3392 阅读 · 0 评论 -
数组往后移动K位----------------------Rotate Array189
Given an array, rotate the array to the right by k steps, where k is non-negative.Example 1:Input: [1,2,3,4,5,6,7] and k = 3Output: [5,6,7,1,2,3,4]Explanation:rotate 1 steps to the right: [7,1...原创 2018-07-28 22:45:33 · 1885 阅读 · 0 评论 -
移动0元素---------- Move Zeroes283
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.Example:Input: [0,1,0,3,12]Output: [1,3,12,0,0]Note:You m...原创 2018-07-28 22:46:27 · 1672 阅读 · 0 评论 -
除本身之外的数组之积- ------------Product of Array Except Self238
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Example:Input: [1,2,3,4]Output: ...原创 2018-07-28 21:48:44 · 1665 阅读 · 0 评论 -
找出重复元素---------------------Find the Duplicate Number287
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, fi...原创 2018-07-28 23:25:31 · 1795 阅读 · 0 评论 -
数组中消失的数--------------------------Find All Numbers Disappeared in an Array448
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Cou...原创 2018-07-30 10:03:00 · 1822 阅读 · 0 评论 -
连续的子数组和为K-------------------Subarray Sum Equals K560
Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Example 1:Input:nums = [1,1,1], k = 2Output: 2Note:The length of t...原创 2018-07-30 11:34:57 · 3573 阅读 · 0 评论 -
Java面试问题集锦(下篇)
摘要: 本文对面试过程中经常会被问到的一些关于Java基础问题进行了梳理和总结,包括 JVM虚拟机、常用容器、设计原则与模式以及Java语言特性等基础知识点,一方面方便自己温故知新,另一方面也希望为找工作的同学们提供一个复习参考。考虑到篇幅太长,现将 《面试/笔试第五弹 —— Java面试问题集锦》 一文分为上下两篇:《面试/笔试第五弹 —— Java面试问题集锦(上篇)》和《面试/笔试第五...转载 2018-08-27 23:47:29 · 2075 阅读 · 0 评论 -
二叉树之字形(Z字型)遍历(LeetCode#103. Binary Tree Zigzag Level Order Traversal)
题目:按照z字形层次遍历二叉树(以根节点所在层为第1层,则第二层的变量从右边节点开始直到最左边节点,第三层遍历则是从最左边开始到最右边)思路:z字形层次遍历是对层次遍历加上了一个限制条件(即相邻层,从左到右的遍历顺序相反),因此还是可以采用队列来实现,只不过节点接入队列时需要考虑加入的顺序代码: 对节点之间的顺序进行维护public class Solution { ...原创 2018-08-28 23:52:44 · 6947 阅读 · 0 评论 -
Leetcode50 求一个数的n次方
思路:我们可以用递归来折半计算,每次把n缩小一半,这样n最终会缩小到0,任何数的0次方都为1,这时候我们再往回乘,如果此时n是偶数,直接把上次递归得到的值算个平方返回即可,如果是奇数,则还需要乘上个x的值。还有一点需要引起我们的注意的是n有可能为负数,对于n是负数的情况,我们可以先用其绝对值计算出一个结果再取其倒数即可,代码如下:public class 求一个数的n次方 { public...原创 2018-09-07 19:16:57 · 950 阅读 · 0 评论 -
两数之和-------------------------Two Sum II - Input array is sorted-LeetCode167
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers ...原创 2018-07-28 19:54:45 · 1651 阅读 · 0 评论 -
求数组的局部峰值-LeetCode162
A peak element is an element that is greater than its neighbors.Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.The array may contain multiple peaks,...原创 2018-07-28 19:31:14 · 3176 阅读 · 0 评论 -
House Robber 房屋偷窃问题
Q:你是一名专业的强盗,计划抢劫沿街的房屋。 每间房屋都藏有一定数量的金钱,唯一阻止你抢劫每间房屋的限制因素是邻近的房屋有保安系统连接,如果在同一晚上有两间 相邻的房屋被闯入,它将自动与警方联系。 已知一份代表每个房屋的金额的列表(房屋里的金额为非负整数),确定你可以在没有提醒警方的情况下抢劫的最高金额。 public int rob(int[] nums) { ...原创 2018-04-07 20:18:06 · 1942 阅读 · 0 评论 -
对称树 问题
给定一个二叉树,判断此树是否是关于自身对称的(即关于它中心对称)For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following [1,2,2,null,3,null,3] is not: 1 / \ 2 2 ...原创 2018-03-30 22:38:44 · 1642 阅读 · 0 评论 -
Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of t原创 2018-03-31 10:38:19 · 1601 阅读 · 0 评论 -
平衡二叉树判断
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as:a binary tree in which the depth of the two subtrees of every node never d原创 2018-03-31 11:06:12 · 1619 阅读 · 0 评论 -
List中的set方法和add方法 以及Pascal's Triangle问题
刷同样的题,遇见同样的问题,list的set方法和add方法add方法是在某个指定的位置加上某个对象,并将原来的位置的那个对象向后挤了一格。set方法是将原来位置上的那个给取代了,并将原来位置上对象的返回。转载自https://blog.csdn.net/bug_moving/article/details/52739137import java.util.LinkedList;import j...转载 2018-03-31 15:24:57 · 1715 阅读 · 0 评论 -
单链表反转
迭代方式:public ListNode reverseList(ListNode head) { ListNode newHead=null; while(head!=null) { ListNode next=head.next; head.next=new原创 2018-04-08 18:57:08 · 1597 阅读 · 0 评论 -
二叉树转置
4 / \ 2 7 / \ / \1 3 6 9转置成 4 / \ 7 2 / \ / \9 6 3 1 public TreeNode invertTree(TreeNode root) { if(root==null) return原创 2018-04-08 20:41:47 · 2317 阅读 · 0 评论 -
买卖股票时机问题
给定一个数组,第i个元素是第i天的股票的价格,如果只允许进行一次交易(即只允许买卖一个股票),设计算法求出最大利润。Example 1:Input: [7, 1, 5, 3, 6, 4]Output: 5max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)...原创 2018-04-01 13:18:50 · 1649 阅读 · 0 评论 -
判断单链表是否是 回文串
思路:for example:[1,1,3,1]1.用一个fast和slow指针分别指向表头, 1->1->3->1sf指针2.快速移动fast指针到表尾,slow指针到表中1->1->3->1->null s f3.用fast指针指向表头,在反转slow开始指向的其余链表1->1 null<-3&...原创 2018-04-08 21:13:46 · 2392 阅读 · 0 评论 -
找出单独的数问题
给定一个数组,除了一个单独的数之外,其余的每个元素都重复2次,找出那个数! 采用亦或操作: public int singleNumber(int[] nums) { int result=0; for(int i=0;i<nums.length;i++) { result^=nums[i]; ...原创 2018-04-01 13:57:17 · 1904 阅读 · 0 评论 -
最大子数组乘积-Leetcode152
Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.Example 1:Input: [2,3,-2,4]Output: 6Explanation: [2,3] ha...原创 2018-07-28 18:57:52 · 1830 阅读 · 0 评论 -
LeetCode69 如果求一个数的平方根?
方法1:使用二分查找 public static double sqrt(double t) { //初始化上界和下届 double low=0; double high=t; double mid=low+(high-low)/2; //给定精度 while(high-low>1e-7) { if(mid*mid>t) high=mid;...原创 2018-09-07 18:47:07 · 2888 阅读 · 0 评论