LeetCode刷题笔记(Easy)
本人在LeetCode上刷的Easy难度的题的题解
早坂爱有些提不起劲
这个作者很懒,什么都没留下…
展开
-
LeetCode刷题笔记(118,杨辉三角,Easy)
class Solution { public List<List<Integer>> generate(int numRows) { List<List<Integer>> result = new ArrayList<List<Integer>>(); if(numRows == 0){ return result; } result..原创 2020-05-29 12:46:58 · 175 阅读 · 0 评论 -
LeetCode刷题笔记(121,买卖股票的最佳时机,Easy)
class Solution { public int maxProfit(int[] prices) { int minstake = Integer.MAX_VALUE; int maxprofit = 0; for(int i : prices){ if(i < minstake){ minstake = i; } maxprofit .原创 2020-05-29 12:45:46 · 105 阅读 · 0 评论 -
LeetCode刷题笔记(112,路径总和,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public boolean hasPathSum(TreeNode root, int sum) { .原创 2020-05-29 12:44:49 · 118 阅读 · 0 评论 -
LeetCode刷题笔记(111,二叉树的最小深度,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public int minDepth(TreeNode root) { if(root == nul.原创 2020-05-29 12:43:10 · 124 阅读 · 0 评论 -
LeetCode刷题笔记(110,平衡二叉树,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public boolean isBalanced(TreeNode root) { if(root .原创 2020-05-29 12:42:05 · 83 阅读 · 0 评论 -
LeetCode刷题笔记(108,将有序数组转换为二叉搜索树,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public TreeNode sortedArrayToBST(int[] nums) { if(n.原创 2020-05-29 12:40:28 · 110 阅读 · 0 评论 -
LeetCode刷题笔记(107,二叉树的层次遍历2,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public List<List<Integer>> levelOrderBottom(Tre.原创 2020-05-29 12:38:55 · 128 阅读 · 0 评论 -
LeetCode刷题笔记(104,二叉树的最大深度,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public int maxDepth(TreeNode root) { if(root == nul.原创 2020-05-29 12:37:24 · 81 阅读 · 0 评论 -
LeetCode刷题笔记(101,对称二叉树,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public boolean isSymmetric(TreeNode root) { return .原创 2020-05-29 12:36:16 · 91 阅读 · 0 评论 -
LeetCode刷题笔记(100,相同的树,Easy)
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { .原创 2020-05-29 12:34:56 · 70 阅读 · 0 评论 -
LeetCode刷题笔记(88,合并两个有序数组,Easy)
class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int site = m-- + n-- -1; //指向数组num1数组的最后一个位置 while(m >= 0 && n >= 0){ if(nums1[m] > nums2[n]){ nums1[site--] =.原创 2020-05-28 12:23:15 · 116 阅读 · 0 评论 -
LeetCode刷题笔记(83,删除链表中的重复元素,Easy)
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public ListNode deleteDuplicates(ListNode head) { ListNode toollinklist = .原创 2020-05-28 12:21:47 · 67 阅读 · 0 评论 -
LeetCode刷题笔记(69,x的平方根,Easy)
class Solution { public int mySqrt(int x) { long left = 0; long right = x / 2; while (left <= right) { long mid = left + (right - left) / 2; long sqr = mid * mid; long nextSqr = (mid + 1) .原创 2020-05-28 12:20:44 · 89 阅读 · 0 评论 -
LeetCode刷题笔记(66,二进制求和,Easy)
class Solution { public String addBinary(String a, String b) { if(a.length() < b.length()){ return addBinary(b,a); } int L = Math.max(a.length(),b.length()); StringBuilder toolman = new StringBuilder(); .原创 2020-05-28 12:19:36 · 104 阅读 · 0 评论 -
LeetCode刷题笔记(70,爬楼梯,Easy)
class Solution { public int climbStairs(int n) { int toolvarible = 0; int num1 = 1; int num2 = 2; if(n<=2){ return n; } for(int i=3;i<=n;i++){ toolvarible = num1+num2; .原创 2020-05-28 12:18:15 · 97 阅读 · 0 评论 -
LeetCode刷题笔记(66,加一,Easy)
class Solution { public int[] plusOne(int[] digits) { int n=digits.length-1; digits[n]++; if(digits[n] != 10){ return digits; }else{ while(n != 0 && digits[n] == 10){ digi.原创 2020-05-28 12:16:58 · 105 阅读 · 0 评论 -
LeetCode刷题笔记(58,最后一个单词的长度,Easy)
class Solution { public int lengthOfLastWord(String s) { int total = 0; int maxtotal = 0; char[] arr = s.toCharArray(); for(int i=0;i<arr.length;i++){ if(arr[i]!=' '){ total++; .原创 2020-05-28 12:15:51 · 74 阅读 · 0 评论 -
LeetCode刷题笔记(53,最大子序和,Easy)
class Solution { public int maxSubArray(int[] nums) { int maxnum=nums[0]; int sum=0; for(int num:nums){ if(sum > 0){ //若当前子数组之和大于0,则加上当前num sum += num; } .原创 2020-05-28 12:14:37 · 99 阅读 · 0 评论 -
LeetCode刷题笔记(38,外观数列,Easy)
class Solution {/**借鉴的一个写题解的大佬的程序理解并提交的。。。 * 解题思路: * 本题的难点在于:报数的概念理解,至少我从题意中没有很清晰的理解,但是感觉像是个递推式 * 从4->5分析,将4个每一位拆开看(个数+数字),4=1211 => 1=11,2=12,11=21,所以5=111221 * 所以解题用循环,从1->n可求解出来 * * @param n * @return .原创 2020-05-28 12:13:20 · 108 阅读 · 0 评论 -
LeetCode刷题笔记(35,搜索插入位置,Easy)
class Solution { public int searchInsert(int[] nums, int target) { int tool = 0; for(int i=0;i<nums.length;i++){ tool = i; if(nums[i]<target){ continue; }else if(nums[i]==target.原创 2020-05-28 12:12:11 · 91 阅读 · 0 评论 -
LeetCode刷题笔记(13,罗马数字转整数,Easy)
class Solution { public int romanToInt(String s) { //char[] array = s.toCharArray(); int sum=0; int priornumber=getValue(s.charAt(0)); //charAt()方法 得到字符串中指定索引的字符型数据。 for(int i=1;i<s.length();i++){ int .原创 2020-05-27 11:47:07 · 135 阅读 · 0 评论 -
LeetCode刷题记录(521,最长特殊序列,Easy)
521.最长特殊序列class Solution { public int findLUSlength(String a, String b) { if(a.equals(b)){ return -1; }else if(a.length() > b.length()){ return a.length(); } return b.length(); .原创 2020-05-27 11:46:18 · 84 阅读 · 0 评论 -
LeetCode刷题笔记(28,实现strStr(),Easy)
class Solution { public int strStr(String haystack, String needle) { if(needle.isEmpty()){ return 0; } char[] array1 = haystack.toCharArray(); char[] array2 = needle.toCharArray(); if(array1.length&l.原创 2020-05-27 11:45:12 · 79 阅读 · 0 评论 -
LeetCode刷题笔记(27,移除元素,Easy)
/*主要是遍历一遍数组,如果该数组元素不等于val,则将当前元素赋值给第i个数组元素,用i来记录长度。*/class Solution { public int removeElement(int[] nums, int val) { if (nums.length == 0) return 0; int i = 0; for (int j = 0; j < nums.length; j++) { if (nums.原创 2020-05-27 11:43:41 · 76 阅读 · 0 评论 -
LeetCode刷题笔记(3,删除数组中的重复项,Easy)
class Solution { public int removeDuplicates(int[] nums) { int demo=0;/*value=0;*/ int j=0; for(int i=1;i<nums.length;i++){ demo=nums[j]; if(demo<nums[i]){ j++; ...原创 2020-05-27 11:41:42 · 99 阅读 · 0 评论 -
LeetCode刷题笔记(21,合并两个有序链表,Easy)
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode l3 = ne.原创 2020-05-27 11:39:38 · 73 阅读 · 0 评论 -
LeetCode刷题笔记(20,有效的括号,Easy)
public class MyStack { private int[] array; private int maxSize; private int top; public MyStack(int size){ this.maxSize = size; array = new int[size]; top = -1; } //压入数据 public void push(int value){ .原创 2020-05-27 11:45:39 · 71 阅读 · 0 评论 -
LeetCode刷题笔记(14,最长公共前缀,Easy)
class Solution { /* 1.找到字符串数组中最短的字符串 最长公共前缀不会比最短的字符串长 2.遍历最短的字符串 从后往前筛选 中间在嵌套一个循环 在依次遍历字符串数组中的字符串 使用substring()方法来截取字符串长度来判断最短字符串是否相等 如若不等则将截取字符串的长度减1 直到将最短的字符串截取完毕为止 */ public String longestCommonPrefix(String[] strs) { .原创 2020-05-27 11:47:18 · 85 阅读 · 0 评论 -
LeetCode刷题笔记(9,回文数,Easy)
class Solution { public boolean isPalindrome(int x) { int temp=x; if(temp<0){ return false; } String str = String.valueOf(temp); char[] array = str.toCharArray(); for(int i=0,j=array.lengt.原创 2020-05-27 11:46:55 · 77 阅读 · 0 评论 -
LeetCode刷题笔记(3,整数反转,Easy)
class Solution { public int reverse(int x) { /*判断X的合法性*/ if(x < -1*Math.pow(2,31) || x > Math.pow(2,31)){ return 0; } int temp=x; //定义一个数来代替x if(temp < 0){ temp *= (-1); .原创 2020-05-27 11:46:42 · 83 阅读 · 0 评论 -
LeetCode刷题笔记(1,两数之和,Easy)
Solution 1:哈希表执行时间:2msclass Solution { public int[] twoSum(int[] nums, int target) { Map<Integer,Integer> map = new HashMap< >(); for(int i=0;i<nums.length;i++) { int minusgap = target-nums[i]; .原创 2020-05-27 11:46:31 · 77 阅读 · 0 评论