lilibaobao89的博客

双指针，维持两者之间的距离在n，这样第二个指针走到尽头的时候，第一个刚好跟尽头相差n。

【代码】17. Letter Combinations of a Phone Number。

这题不用去重，其实比之前的要简单。

很聪明的做法，先假设第一个string是Longest Common Prefix， 跟后面的string一个一个对比，不match就删除最后一个字符，until it matches。

【代码】11. Container With Most Water。

【代码】8. String to Integer (atoi)

【代码】7. Reverse Integer。

【代码】5. Longest Palindromic Substring。

【代码】1762. Buildings With an Ocean View。

【代码】1249. Minimum Remove to Make Valid Parentheses。

【代码】408. Valid Word Abbreviation。

【代码】2. Add Two Numbers。

Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL./** * Definition for s

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {

当循环结束时，如果没有找到target，那么low一定停target应该插入的位置上，high一定停在恰好比target小的index上。public class Solution { public int searchInsert(int[] nums, int target) { if(nums == null || nums.length == 0){

public class Solution { public int removeDuplicates(int[] nums) { int i=0; for(int j=1; j<nums.length; j++){ if(nums[i] != nums[j]){ i++;

public class Solution { public List> combinationSum(int[] c, int t) { if(c == null || c.length == 0){ return null; } List> result = new ArrayList>(); Li

Given n processes, each process has a unique PID (process id) and its PPID (parent process id).Each process only has one parent process, but may have one or more children processes. This is just l

You want to build a house on an empty land which reaches all buildings in the shortest amount of distance. You can only move up, down, left and right. You are given a 2D grid of values 0, 1 or 2, wh

Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.要点就是要把900,400等特殊数字的表达方式加上，再按大小依次往下除即可 public String intToRoman(int num) { if(num &...