算法
yesIcando-bupt
stay hungry stay foolish
展开
-
leetcode -- happy number 快乐数
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2017-08-13 17:59:42 · 382 阅读 · 0 评论 -
LeetCode-Odd Even Linked List (Java)
ProblemGiven a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.The program s原创 2017-03-21 09:56:34 · 220 阅读 · 0 评论 -
链表排序(冒泡、选择、插入、快排、归并、希尔、堆排序)
这篇文章分析一下链表的各种排序方法。 以下排序算法的正确性都可以在LeetCode的链表排序这一题检测。本文用到的链表结构如下(排序算法都是传入链表头指针作为参数,返回排序后的头指针)struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} };转载 2017-03-06 09:45:43 · 452 阅读 · 0 评论 -
反转链表
题目描述输入一个链表,反转链表后,输出链表的所有元素。public ListNode ReverseList(ListNode head) {if(head==null) return null; //head为当前节点,如果当前节点为空的话,那就什么也不做,直接返回null; ListNode pre = nu原创 2017-03-09 09:28:06 · 200 阅读 · 0 评论 -
最长回文子串
Finding the longest palindromic substring is a classic problem of coding interview. This post summarizes 3 different solutions for this problem.要求:给定一个字符串S,找出它的最长回文子串。假定S的最大长度为1000,且最长回文子串原创 2017-02-26 11:06:51 · 236 阅读 · 0 评论 -
LeetCode -130-Surrounded Regions
LeetCode -130-Surrounded Regions (Java) Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surround原创 2017-02-25 22:54:10 · 91 阅读 · 0 评论 -
[编程题]两个链表的第一个公共结点
输入两个链表,找出它们的第一个公共结点。链接:https://www.nowcoder.com/questionTerminal/6ab1d9a29e88450685099d45c9e31e46?source=relative来源:牛客网123456789101112131415原创 2017-03-04 16:33:55 · 272 阅读 · 0 评论 -
leetcode 151. Reverse Words in a String --------- java
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".解题思路:本题方法多多,最简单的方式直接按“ ” spilt即可,JAVA实现如下:1原创 2017-02-25 14:53:02 · 321 阅读 · 0 评论 -
LeetCode-Remove K Digits 去掉K位数字
LeetCode – Remove K Digits (Java) Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.Note:The l转载 2017-03-04 13:38:39 · 432 阅读 · 0 评论 -
单链表是否有环--Java
题目:判断一个带头结点的单链表L是否有环解题思路:咋看之下,这题还真不好解,于是又一些投机取巧的人,在访问单链表中元素的时候,用一个比较大的数N控制访问元素的个数,他们认为如果在访问到第N个元素之前有一个元素为null,那么单链表没有环,反之,单链表有环。他们的解释是都访问了这么多元素了,还没有一个元素为空,单链表很有可能有环,再加上一般单链表中的元素都不超过N个,所以单链表有环。对于原创 2017-03-01 21:35:00 · 272 阅读 · 0 评论 -
链表面试题Java实现【重要】
【正文】这份笔记整理了整整一个星期,每一行代码都是自己默写完成,并测试运行成功,同时也回顾了一下《剑指offer》这本书中和链表有关的讲解,希望对笔试和面试有所帮助。OMG! 本文包含链表的以下内容: 1、单链表的创建和遍历 2、求单链表中节点的个数 3、查找单链表中的倒数第k个结点(剑指offer,题15) 4、查找单链表中的中间结原创 2017-03-01 15:53:50 · 88 阅读 · 0 评论 -
最大子数组与股票交易
LeetCode – Maximum Subarray (Java) Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,原创 2017-03-21 10:48:02 · 417 阅读 · 0 评论 -
最长串问题
Longest Common Prefixpublic class Solution { /* int indexOf(int ch) 返回指定字符在此字符串中第一次出现处的索引。 int indexOf(int ch, int fromIndex) 从指定的索引开始搜索,返回在此字符串中第一次出现指定字符处的索引。 int indexOf(原创 2017-03-13 08:56:50 · 275 阅读 · 0 评论 -
LeetCode – LongestIncreasing Subsequence (Java)
Given an unsorted array of integers, find the length of longestincreasing subsequence.For example, given [10, 9, 2, 5, 3, 7, 101, 18], the longestincreasing subsequence is [2, 3, 7, 101]. Therefore原创 2017-03-13 10:09:58 · 263 阅读 · 0 评论 -
【LeetCode】Course Schedule--拓扑排序
【题目】There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is exp原创 2017-05-09 11:12:03 · 398 阅读 · 0 评论 -
Java实现图的遍历(深搜与广搜)
本文以邻接矩阵作为存储结构,用Java实现图的遍历,话不多说,先给出的图的结构,如下: 1、深度优先搜索遍历 思想: 沿着树的深度遍历树的节点,尽可能深的搜索树的分支。当节点v的所有边都己被探寻过,搜索将回溯到发现节点v的那条边的起始节点。这一过程一直进行到已发现从源节点可达的所有节点为止。如果还存在未被发现的节点,则选择其中一个作为源节点并重复以上过程,整个进程反复进行直到所原创 2017-04-26 09:50:39 · 3768 阅读 · 0 评论 -
MergeSort与QuickSort
快排public class QuickSortTest { private int array[]; private int length; public void sort(int[] inputArr) { if (inputArr == null || inputArr.length == 0) {原创 2017-05-08 10:34:42 · 322 阅读 · 0 评论 -
【LeetCode】Gas Station 解题报告
【题目】There 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 sta原创 2017-04-24 09:43:44 · 234 阅读 · 0 评论 -
Median of Two Sorted Array leetcode java
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 题解:首先我们先明确什么是med原创 2017-05-05 10:14:00 · 363 阅读 · 0 评论 -
[Leetcode] Lowest Common Ancestor of a Binary Tree 最小公共祖先
推荐 1 推荐收藏 2 收藏,7.4k 浏览Lowest Common Ancestor of a Binary Search TreeGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.Ac原创 2017-05-04 18:56:58 · 327 阅读 · 0 评论 -
leetcode- 131Palindrome Partitioning
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","原创 2017-04-04 13:51:35 · 421 阅读 · 0 评论 -
house robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house原创 2017-03-17 10:26:41 · 214 阅读 · 0 评论 -
排列组合
77. CombinationsGiven 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],原创 2017-03-16 10:19:03 · 380 阅读 · 0 评论 -
leetcode128--longest consecutive sequence(java)
[leetcode]longest consecutive sequence(java)分类:leetcode问题描述: Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Give原创 2017-01-18 22:40:51 · 365 阅读 · 0 评论 -
Leetcode 451. Sort Characters By Frequency 按频率对字符排序
Given a string, sort it in decreasing order based on the frequency of characters.Example 1:Input:"tree"Output:"eert"Explanation:'e' appears twice while 'r' and 't' both appear once.So 'e原创 2017-02-28 09:56:28 · 480 阅读 · 0 评论 -
LeetCode-120. Triangle
LeetCode-120. TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[原创 2017-01-12 16:43:04 · 178 阅读 · 0 评论 -
leetcode--85. Maximal Rectangle
85. Maximal RectangleGiven a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.For example, given the following matrix:1 0 1原创 2016-12-24 17:02:57 · 199 阅读 · 0 评论 -
LeetCode84 --Largest Rectangle in Histogram
LeetCode84 Largest Rectangle in Histogram java标签: LeetCodeStackJavaLargest Rectangle in 分类:题目:Given n non-negative integers representing the histogram's bar height where the widt原创 2016-12-23 11:08:06 · 266 阅读 · 0 评论 -
map遍历与统计
遍历Map方法一(通过HashMap类实现统计单词出现次数)要求:通过命令行输入多个单词,单词之间用逗号分开,统计每个单词出现的次数,并把单词和其出现的次数分别打印出来,使用HashMap类实现。输入单词如下图:package michael.wlq;import java.util.HashMap;import java.原创 2016-12-22 17:09:04 · 711 阅读 · 0 评论 -
背包问题
[LintCode] Backpack I II III IV V VI [背包六问]Backpack IProblem 单次选择+最大体积Given n items with size Ai, an integer m denotes the size of a backpack. How full you can fill this ba转载 2017-01-01 22:21:39 · 226 阅读 · 0 评论 -
逆转交替合并两个链表的解析与实现
逆转交替合并两个链表的解析与实现本篇文章主要介绍了将两个链表逆转交替合并的实现思路与方法,需要的朋友可以参考下逆转交替合并两个链表,即从一个链表的尾指针指向另一个链表的尾指针,依次逆转交替进行合并。下面就通过实例来详细的介绍该逆转交替合并两个链表的思路与实现代码。一、问题描述链表A和BA: 1->2->3->4B: a->b->c->d请原创 2016-12-14 10:25:03 · 774 阅读 · 0 评论 -
N-Queens八皇后问题
回溯法求解八皇后问题标签: 八皇后问题描述:八皇后问题是一个以国际象棋为背景的问题:如何能够在 8×8 的国际象棋棋盘上放置八个皇后,使得任何一个皇后都无法直接吃掉其他的皇后?为了达到此目的,任两个皇后都不能处于同一条横行、纵行或斜线上。 问题历史:八皇后问题最早是由国际象棋棋手马克斯·贝瑟尔于1848年提出。之后陆续有数学家对其进行研究,其原创 2016-12-09 10:42:14 · 322 阅读 · 0 评论 -
通配符匹配
Wildcard Matching(通配符匹配)Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence).原创 2016-12-08 17:03:34 · 430 阅读 · 0 评论 -
Multiply Strings
Multiply Strings2015-01-03 08:05 107人阅读 评论(0) 收藏 举报 分类:Remember(35) Review(50) LeetCode(137) Given two numbers represented as strings, return multiplication of the number转载 2016-12-06 10:58:33 · 229 阅读 · 0 评论 -
Count and Say--数数
Count and Say 主题 Java LeetCode题目 :The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...is read off as "one 1" or .i原创 2016-12-05 23:09:28 · 225 阅读 · 0 评论 -
二分法查找的算法
例一:Search in Rotated Sorted ArraySuppose 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原创 2016-12-19 15:18:22 · 307 阅读 · 0 评论 -
二叉树以及前序遍历、中序遍历和后序遍历
java编写二叉树以及前序遍历、中序遍历和后序遍历[java] view plain copy /** * 实现二叉树的创建、前序遍历、中序遍历和后序遍历 **/ package DataStructure; /** * Copyright 2014 by Ruiqin Sun *原创 2016-12-26 16:56:54 · 243 阅读 · 0 评论 -
二叉树
二叉树题目2017-01-03 10:20 0人阅读 评论(0) 收藏 编辑 删除 分类:算法(15) 版权声明:本文为博主原创文章,未经博主允许不得转载。package Algorithms.tree; import java.util.ArrayList;原创 2017-01-04 09:55:31 · 344 阅读 · 0 评论 -
[LeetCode] Best Time to Buy and Sell Stock I II III IV 股票买卖
[LeetCode] Best Time to Buy and Sell Stock I II III IVBest Time to Buy and Sell Stock IDescription: Say you have an array for which the ith element is the price of a given stock on day i.原创 2017-01-12 11:26:22 · 527 阅读 · 0 评论 -
List集合remove元素的问题
List集合remove元素的问题import java.util.*; public class object { public static void main(String[] args) { String str1 = new String("abcde"); String str2 = new String("abcde"); Strin转载 2017-01-11 16:22:39 · 132 阅读 · 0 评论