算法
once_charming
这个作者很懒,什么都没留下…
展开
-
LeetCode 229 --- Majority Element II
题目链接: LeetCode 229 — Majority Element IIAC代码:public class Problem229 { public static void main(String[] args) { // TODO Auto-generated method stub int[] name ={1,1,1,2,3}; m原创 2017-02-21 19:03:49 · 322 阅读 · 0 评论 -
LeetCode 56 --- Merge Intervals
题目链接: LeetCode 56 — Merge IntervalsAC代码:class Interval { int start; int end; Interval() { start = 0; end = 0; } Interval(int s, int e) { start = s; end = e; } @Override p原创 2017-02-19 20:17:07 · 262 阅读 · 0 评论 -
LeetCode 55 --- Jump Game
题目链接: LeetCode 55 — Jump GameAC代码:public class Problem55 { public static void main(String[] args) { // TODO Auto-generated method stub } public boolean canJump(int[] nums) {原创 2017-02-19 20:15:42 · 186 阅读 · 0 评论 -
LeetCode 54 --- Spiral Matrix
题目链接: LeetCode 54 — Spiral MatrixAC代码://参考 https://discuss.leetcode.com/topic/64099/easy-java-solution-with-explainationpublic class Problem54 { public static void main(String[] args) { /转载 2017-02-19 20:14:17 · 229 阅读 · 0 评论 -
LeetCode 495 --- Teemo Attacking
题目链接: LeetCode 495 — Teemo AttackingAC代码:public class Problem495 { public static void main(String[] args) { // TODO Auto-generated method stub int[] name={1,2}; System.out.p原创 2017-02-19 20:10:45 · 706 阅读 · 0 评论 -
LeetCode 485 --- Max Consecutive Ones
题目链接: LeetCode 485 — Max Consecutive OnesAC代码:public class Problem485 { public static void main(String[] args) { // TODO Auto-generated method stub int[] name={1,1,0,1,1,1};原创 2017-02-19 20:09:18 · 359 阅读 · 0 评论 -
LeetCode 48 --- Rotate Image
题目链接: LeetCode 48 — Rotate ImageAC代码:public class Problem48 { public static void main(String[] args) { // TODO Auto-generated method stub int [][] ss={{1,2},{3,4}}; rotate(s原创 2017-02-19 20:07:11 · 228 阅读 · 0 评论 -
LeetCode 45 --- Jump Game II
题目链接: LeetCode 45 — Jump Game IIAC代码:public class Problem45 { public static void main(String[] args) { // TODO Auto-generated method stub } public int jump(int[] nums) { if(n原创 2017-02-19 20:05:41 · 206 阅读 · 0 评论 -
LeetCode 448 --- Find All Numbers Disappeared in an Array
题目链接: LeetCode 448 — Find All Numbers Disappeared in an ArrayAC代码:public class Problem448 { public static void main(String[] args) { int [] a={4,3,2,7,8,2,3,1}; // TODO Auto-generat原创 2017-02-19 20:03:31 · 200 阅读 · 0 评论 -
LeetCode 442 --- Find All Duplicates in an Array
题目链接: LeetCode 442 — Find All Duplicates in an Array问题分析: 需要o(n)的时间复杂度并且不能使用额外的存储空间。找出数组中的重复元素。AC代码:public class Problem442 { public static void main(String[] args) { // TODO Auto-generat原创 2017-02-19 19:53:49 · 692 阅读 · 0 评论 -
LeetCode 42 --- Trapping Rain Water
题目链接: LeetCode 42 — Trapping Rain Water问题分析: 贪心思路,很简单。AC代码:public class Problem42 { public static void main(String[] args) { // TODO Auto-generated method stub\ int[] a={};原创 2017-02-19 19:47:33 · 185 阅读 · 0 评论 -
LeetCode 414 --- Third Maximum Number
题目链接: LeetCode 414 — Third Maximum NumberAC代码:public class Problem414 { public static void main(String[] args) { // TODO Auto-generated method stub int[] aa={2,2,3,1}; thir原创 2017-02-19 19:41:41 · 214 阅读 · 0 评论 -
LeetCode 169 --- Majority Element
题目链接: LeetCode 169 — Majority Element AC代码:public class Problem169 { public int majorityElement(int[] nums) { int m=nums[0],n=0; for(int i=0;i<nums.length;i++){ if(num原创 2017-02-19 19:37:29 · 190 阅读 · 0 评论 -
LeetCode 57 --- Insert Interval
题目链接: LeetCode 57 — Insert IntervalAC代码:public class Problem57 { public static void main(String[] args) { List <Interval> list =new ArrayList<Interval>(); list.add(new Interval(0,2原创 2017-02-19 20:18:42 · 242 阅读 · 0 评论 -
LeetCode 59 --- Spiral Matrix II
题目链接: LeetCode 59 — Spiral Matrix IIAC代码:public class Problem59 { public static void main(String[] args) { // TODO Auto-generated method stub } //参考https://discuss.leetcode.com/topic转载 2017-02-19 20:20:23 · 209 阅读 · 0 评论 -
LeetCode 90 --- Subsets II
题目链接: LeetCode 90 — Subsets IIAC代码:public class Problem90 { public static void main(String[] args) { // TODO Auto-generated method stub } public List<List<Integer>> subsetsWithDup(in原创 2017-02-21 17:13:15 · 363 阅读 · 0 评论 -
LeetCode 88 --- Merge Sorted Array
问题链接:LeetCode 88 — Merge Sorted ArrayAC代码:public class Problem88 { public static void main(String[] args) { // TODO Auto-generated method stub } //参考 https://discuss.leetcode.com/topi转载 2017-02-21 17:11:39 · 279 阅读 · 0 评论 -
LeetCode 80 --- Remove Duplicates from Sorted Array II
题目链接: LeetCode 80 — Remove Duplicates from Sorted Array IIAC代码:public class Problem80 { public static void main(String[] args) { // TODO Auto-generated method stub } public int remov原创 2017-02-21 17:09:38 · 238 阅读 · 0 评论 -
LeetCode 78 --- Subsets
题目链接: LeetCode 78 — SubsetsAC代码:public class Problem78 { public static void main(String[] args) { // TODO Auto-generated method stub } public List<List<Integer>> subsets(int[] nums)原创 2017-02-21 17:07:43 · 235 阅读 · 0 评论 -
LeetCode 75 --- Sort Colors
题目链接: LeetCode 75 — Sort ColorsAC代码:public class Problem75 { public static void main(String[] args) { // TODO Auto-generated method stub } public class Solution { public void原创 2017-02-21 17:06:37 · 276 阅读 · 0 评论 -
LeetCode 74 --- Search a 2D Matrix
题目链接:LeetCode 74 — Search a 2D MatrixAC代码:public class Problem74 { public static void main(String[] args) { } // TODO Auto-generated method stub public boolean searchMatrix(int[][] ma原创 2017-02-21 17:04:51 · 372 阅读 · 0 评论 -
LeetCode 73 --- Set Matrix Zeroes
题目链接: LeetCode 73 — Set Matrix ZeroesAC代码:public class Problem73 { public static void main(String[] args) { // TODO Auto-generated method stub } public void setZeroes(int[][] matrix原创 2017-02-21 17:03:06 · 244 阅读 · 0 评论 -
LeetCode 66 --- Plus One
题目链接: AC代码:public class Problem66 { public static void main(String[] args) { // TODO Auto-generated method stub } public int[] plusOne(int[] digits) { for(int i=digits.length-1原创 2017-02-21 17:01:27 · 192 阅读 · 0 评论 -
LeetCode 64 --- Minimum Path Sum
题目链接: LeetCode 64 — Minimum Path SumAC代码:public class Problem64 { public static void main(String[] args) { // TODO Auto-generated method stub } public int minPathSum(int[][] grid) {原创 2017-02-19 20:59:32 · 202 阅读 · 0 评论 -
LeetCode 63 --- Unique Paths II
题目链接: LeetCode 63 — Unique Paths IIAC代码:public class Problem63 { public static void main(String[] args) { // TODO Auto-generated method stub } public int uniquePathsWithObstacles(int原创 2017-02-19 20:47:20 · 181 阅读 · 0 评论 -
LeetCode 62 --- Unique Paths
题目链接: LeetCode 62 — Unique Paths问题分析: 简单dp。AC代码:public class Problem62 { public static void main(String[] args) { // TODO Auto-generated method stub System.out.println(uniquePaths(5原创 2017-02-19 20:22:56 · 210 阅读 · 0 评论 -
LeetCode 41---First Missing Positive
题目链接: LeetCode 41—First Missing Positive AC代码:public class Problem41 { public static void main(String[] args) { // TODO Auto-generated method stub int[] a={1}; System.out.p原创 2016-12-28 22:10:24 · 523 阅读 · 1 评论 -
LeetCode 40---Combination Sum II
题目链接如下: LeetCode 40—Combination Sum IIAC代码如下:import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Problem40 { public static void main(String[] args) { int原创 2016-12-28 22:07:56 · 223 阅读 · 0 评论 -
LeetCode 4---Median of Two Sorted Arrays
题目链接: 转载自:http://www.lxway.com/49629084.htm AC代码如下:、public class Problem4 { public static void main(String[] args) { // TODO Auto-generated method stub int[] nums1={1,3}; i转载 2016-12-28 22:06:06 · 173 阅读 · 0 评论 -
PAT1050
题目链接:PAT1050(A) 本题使用空间换时间的做法,不然直接将b表中的元素在A表中查找是o(mn)的复杂度,会超时,AC代码如下:#include<stdio.h>char post1[1000005];char post2[1000005];int acc[130]={0};int main(){ int i,j; gets(post1); gets(pos原创 2016-03-04 22:44:34 · 219 阅读 · 0 评论 -
LeetCode 219--- Contains Duplicate II
题目链接:LeetCode 219— Contains Duplicate II题目大意:判断给定数组中是否存在索引序号相差最大为k的两个相等的项使用一个哈希表的思路即可轻松解决,实现代码如下:public class Problem219 { public static void main(String[] args) { // TODO Auto-generated me原创 2016-12-23 15:08:25 · 210 阅读 · 0 评论 -
LeetCode 217---Contains Duplicate
题目链接:LeetCode 217—Contains Duplicate题目大意:即判断一个数组中是否有重复元素采用一个Set容器即可轻松解决。实现代码:public class Problem217 { public static void main(String[] args) { // TODO Auto-generated method stub } pu原创 2016-12-23 15:01:49 · 205 阅读 · 0 评论 -
LeetCode 209---Minimum Size Subarray Sum
题目链接:LeetCode 209—Minimum Size Subarray Sum题目大意:求出正整数无序序列中长度最小的子序列的元素和等于目标数,如果没有这样的数,则返回0。实现代码:public class Problem209 { public static void main(String[] args) { // TODO Auto-generated metho原创 2016-12-23 14:55:53 · 202 阅读 · 0 评论 -
LeetCode 189---Rotate Array
题目链接:LeetCode 189—Rotate Array题目大意:将给定顺序数组(1–n)循环右移k位,如: n=7,k=3 则将[1,2,3,4,5,6,7] –> [5,6,7,1,2,3,4]实现代码如下:public class Problem189 { public static void main(String[] args) { // TODO原创 2016-12-23 14:51:16 · 185 阅读 · 0 评论 -
LeetCode 18---4Sum
题目链接:LeetCode 18—4Sum 题目大意是求无序数组中4个数的和等于目标数,并列出所有可能。 可采用递归思路在列表中固定一个数,相当于缩小了问题规模,将问题变成3个数的和等于目标数……. 采用这种递归的思路即可解除任意数目的数的和等于目标数的问题,实现代码如下:public class Problem18 { public static void main(String[] a原创 2016-12-23 14:42:27 · 310 阅读 · 1 评论 -
LeetCode167---Input array is sorted
题目链接:LeetCode167—Input array is sorted 求有序数组中两个数的和等于目标数,可设置两个指针分别指向头尾,采用贪心思路,遍历一遍数组即可完成,代码如下:public class Problem167 { public static void main(String[] args) { // TODO Auto-generated method原创 2016-12-23 14:34:59 · 212 阅读 · 0 评论 -
LeetCode 162--- Find Peak Element
题目链接如下:LeetCode 162—Find Peak Element简单题,没什么好说的,实现代码如下:public class Problem162 { public static void main(String[] args) { // TODO Auto-generated method stub } public int findPeakEleme原创 2016-12-23 13:21:18 · 277 阅读 · 1 评论 -
LeetCode 16---3Sum Closest
题目链接:LeetCode 16—3Sum Closest求一个无序数组中三个数的和最接近目标数的结果, 先排序再进行计算即可,实现代码如下:public class Problem16 { public static void main(String[] args) { // TODO Auto-generated method stub } public s原创 2016-12-23 13:14:41 · 227 阅读 · 0 评论 -
LeetCode 154---Find Minimum in Rotated Sorted Array II
题目链接:LeetCode 154— Find Minimum in Rotated Sorted Array II在153题的基础上增加了允许数字重复的条件,但仍然可以使用原来的方法,遍历一遍数组即完成任务,实现代码如下:public class Problem154 { public static void main(String[] args) { // TODO Aut原创 2016-12-23 13:07:17 · 283 阅读 · 1 评论 -
LeetCode 153--- Find Minimum in Rotated Sorted Array
题目链接:LeetCode 153— Find Minimum in Rotated Sorted Array简单题,实在没什么可说,实现代码如下:public class Problem153 { public static void main(String[] args) { // TODO Auto-generated method stub } publi原创 2016-12-23 13:02:14 · 203 阅读 · 1 评论