题目：Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).Example 1:Input: [1,3,5,4,7] Output: 3 Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. Even though [1,3,5,7] is also an increasing subsequence, it‘s not a continuous one where 5 and 7 are separated by 4. Example 2:Input: [2,2,2,2,2] Output: ...
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed. 给一个链表，两两交换。 我的思路是两对两对看，但是分为三种情况，这对和后面的情形是：1-2-3-4；1-2-3；1-2；然后根据不同的情况写出他们的...
【033-Search in Rotated Sorted Array（在旋转数组中搜索）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Suppose a sorted array 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 found in the array return its index, otherwise return -1. You may assume no duplicate exists in the array. 题目大...
题目在这里: https://leetcode.com/problems/remove-nth-node-from-end-of-list/【标签】 Linked List; Two Pointers【个人分析】 这个题目应该算是Linked List里面的基础题。说它基础不是因为它简单，而是因为它是基石。一些 Linked list中经典方法在这道题里面都有应用。 1. Two Pointers 在 Linked List中: 如果能预先链表知道长度，那题目就简单多了，删掉从头开始的 Len - N就完事了。但是，LinkedList是没有办法预先知...
刷题背景担心找不到工作。看think in java略枯燥，传智播客的视频太浅显。于是刷题练习算法和java。废话少说。题：java菜鸟一枚，用自己的编译器便于检查语法错误。所以首先写了一个main函数，用于测试。 1publicstaticvoid main(String[] args)2 {3 Scanner input=new Scanner(System.in);4 String s=input.nextLine();5 String[] s1=s.split(",");6int len=s1.length;7int[] nums=newint[len];8int i...
【058-Length of Last Word （最后一个单词的长度）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 Given a string s consists of upper/lower-case alphabets and empty space characters ‘ ‘, return the length of last word in the string. If the last word does not exist, return 0. Note: A word is defined as a character sequence consists of non-space characters only. For example, Given s ...
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"]]回溯算法，需要注意的就是在得到子串时判断是否为回文字符串（需要自己写函数），如果是才继续展开下一层。代码： 1public List<List<String>> partition(String s) {2 List<List<String>> re = new ArrayL...
Suppose a sorted array 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).Find the minimum element.The array may contain duplicates.解题思路：参考Java for LeetCode 081 Search in Rotated Sorted Array II JAVA实现如下： public int findMin(int[] nums) {int left = 0, right = nums.length - 1, res = nums[0];while (left <= right) {res = Math.min(nums[left]...
Implement Queue using Stacksclass MyQueue { Stack<Integer> s1 = new Stack<>(); Stack<Integer> s2 = new Stack<>(); // Push element x to the back of queue. publicvoid push(int x) { s1.push(x); } // Removes the element from in front of queue. publicvoid pop() { if(!s2.isEmpty()) s2.pop(); else { while(!s1.isEmpty()) s2.push(s1.pop()); s2.pop(); } } // Get the front element. publicint ...
题目描述题干： 给你一个整数 turnedOn ，表示当前亮着的 LED 的数量，返回二进制手表可以表示的所有可能时间。 你可以 按任意顺序 返回答案。 小时不会以零开头： 例如，"01:00" 是无效的时间，正确的写法应该是 "1:00" 。 分钟必须由两位数组成，可能会以零开头： 例如，"10:2" 是无效的时间，正确的写法应该是 "10:02" 。示例1： 输入：turnedOn = 1 输出：["0:01","0:02","0:04","0:08","0:16","0:32","1:00","2:00","4:00","8...
题目： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. For example: Given array A = [2,3,1,1,4] The minimum number of jumps to reach the last index is 2. (Jump 1 stepfrom index 0 to 1, then 3 step...
Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree. 解题思路一：preorder[0]为root，以此分别划分出inorderLeft、preorderLeft、inorderRight、preorderRight四个数组，然后root.left=buildTree(preorderLeft,inorderLeft); root.right=buildTree(preorderRight,inorderRight)JAVA实现如下： public TreeNode buildTree(int[] preorder...
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.解题思路：同上题，JAVA实现如下： public TreeNode sortedListToBST(ListNode head) {ArrayList<Integer> list=new ArrayList<Integer>();while(head!=null){list.add(head.val);head=head.next;}return sortedListToBST(list,0,list.size()-1);}static public TreeNode sortedListToBST(ArrayList<Integer> l...
Gas Station Total Accepted: 39396 Total Submissions: 153479There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.Return the starting gas station‘s index if you can tra...
Problem: Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. Here are few examples.[1,3,5,6], 5 → 2[1,3,5,6], 2 → 1[1,3,5,6], 7 → 4[1,3,5,6], 0 → 0Solution:二分查找，当找不到时l=r+1,所以根据最后一次l和r的变动来判定应该插入的位置，如果最后一次是l=mid+...