java
文章平均质量分 64
yiqiqiwww
这个作者很懒,什么都没留下…
展开
-
剑指offer
题目描述统计一个数字在排序数组中出现的次数public class Solution { public int GetNumberOfK(int [] array , int k) { int length = array.length; if(length == 0){ return 0; } int原创 2017-09-25 10:46:12 · 132 阅读 · 0 评论 -
leetcode—Word Search
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 n原创 2018-01-08 22:00:54 · 362 阅读 · 0 评论 -
leetcode—Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3], a solution is: [原创 2018-01-07 09:05:49 · 242 阅读 · 0 评论 -
leetcode—Combinations
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],原创 2018-01-06 16:15:03 · 204 阅读 · 0 评论 -
leetcode—Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right. The first integer of each row原创 2018-01-06 16:13:06 · 208 阅读 · 0 评论 -
leetcode—Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0,原创 2018-01-05 22:58:52 · 267 阅读 · 0 评论 -
leetcode—Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3): “123” “132” “213” “231”原创 2018-01-04 21:39:58 · 217 阅读 · 0 评论 -
剑指offer—替换空格
题目描述 请实现一个函数,将一个字符串中的空格替换成“%20”。例如,当字符串为We Are Happy.则经过替换之后的字符串为We%20Are%20Happy。public class Solution{ public String replaceSpace(StringBuffer str){ StringBuffer strNew = new StringBuffe原创 2017-12-05 21:26:30 · 142 阅读 · 0 评论 -
剑指offer
题目描述:给定一个double类型的浮点数base和int类型的整数exponent。求base的exponent次方。 本题知识点注意边界点,base为0,exponent为负数的时候,其次注意exponent为负数的情况,并且这一题注意能用移位就不要用乘除,取余应该用与操作代替public class Solution { public double Power(double b原创 2017-09-26 09:02:32 · 138 阅读 · 0 评论 -
Remove Duplicates from Sorted Array系列
Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra space for another ar原创 2018-01-09 16:03:11 · 214 阅读 · 0 评论