hcx2013
- 浏览: 88933 次
-
最新评论
-
hcx2013：
mircle 写道Given nums = [1, 2, 1, ...
Single Number III -
mircle：
Given nums = [1, 2, 1, 3, 2, 5， ...
Single Number III -
hcx2013：
恩，可以，代码更简洁
空格替换 -
QuarterLifeForJava：
这样可以吗？
public static void main( ...
空格替换 -
hcx2013：
这个2是指多出2位，按你的理解可以这么改：int len = ...
空格替换
文章列表
package edu.xidian.graph;
class MyStack {
private final int SIZE = 20;
private int[] st;
private int top;
public MyStack() {
st = new int[SIZE];
top = -1;
}
public void push(int j) {
st[++top] = j;
}
public int pop() {
return st[top--];
}
public int peek() ...
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1and nums2 are m and n respectively ...
Scramble String
- 博客分类：
- leetcode
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 = "great":
great
/ \
gr eat
/ \ / \
g r e at
/ \
a t
To scramble the str ...
Partition List
- 博客分类：
- leetcode
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
For example,Given 1->4->3->2->5->2 and x = 3,return 1->2->2 ...
Maximal Rectangle
- 博客分类：
- leetcode
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.
public class Solution {
public int maximalRectangle(char[][] matrix) {
if (matrix==null || matrix.length==0 || matrix[0].length==0) {
return 0;
}
...
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].
The largest rectangle is shown in t
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,Given 1->2->3->3->4->4->5, return 1->2->5.Given 1->1->1->2->3, return 2->3.
/**
* Definition for singly-linked lis ...
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListN ...
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
public class Solution {
public boolean search(int[] nums, int target) {
...
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?
For example,Given sorted array nums = [1,1,1,2,2,3],
Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and
Word Search
- 博客分类：
- leetcode
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.
For example,Given board ...
Given a set of distinct integers, nums, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,If nums = [1,2,3], a solution is:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[ ...
Combinations
- 博客分类：
- leetcode
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,If n = 4 and k = 2, a solution is:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
public class Solution {
public List<List<Integer>> combine(int n, int k) { ...
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
For example,S = "ADOBECODEBANC"T = "ABC"
Minimum window is "BANC".
Note:If there is no such window in S that covers all characters in T, retu ...
求100内的质数。
#!/bin/bash
declare i=2;
while (($i<=100)); do
ret=0;
for ((j=2;j<$i;j++));do
if (($(($i%$j))==0)); then
ret=1;
break;
fi
done
if (($ret==0));then
echo "$i";
fi
i=$((i+1));
done
编写个shell脚本将当前目录下大于10K的文件转移到/tmp目录下
#!/bin ...