算法
文章平均质量分 74
星之空殇
这个作者很懒,什么都没留下…
展开
-
求大数积
Divide and ConquerImplement the Karatsuba algorithm for Multiplication problem in your favourite language, andcompare the performance with quadratic grade-school method.import java.util.Scanner;原创 2015-11-02 22:23:37 · 415 阅读 · 0 评论 -
LinkedList+HashMap实现LRU算法
package Interview;import java.util.HashMap;import java.util.Map;/* * 实现最近最少使用算法,且get,put时间复杂度为O(1) * */public class LRUCache { private Map cache; DLinkedList tail=null; DLinkedList head=n原创 2017-08-15 21:30:34 · 1358 阅读 · 0 评论 -
树的遍历(前序,中序,后续,栈与递归实现)
树的定义public class TreeNode { public TreeNode left; public TreeNode right; public int val; public TreeNode(int val){ this.val=val; this.left=null; this.right=null; }}前序遍历public void原创 2017-07-24 21:50:20 · 427 阅读 · 0 评论 -
最长子序列回文问题,Longest Palindromic Subsequence
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1:Input: "bbbab"Output:4One possible longest palin原创 2017-06-03 16:01:23 · 349 阅读 · 0 评论 -
求二叉树的高度
package com.djx.tree;public class Tree_Depth { public static void main(String[] args) { // TODO Auto-generated method stub TreeNode root=new TreeNode(0); TreeNode node1=new TreeNode(1);原创 2016-10-20 22:25:15 · 447 阅读 · 0 评论 -
网络流男女配对问题java实现
package test;import java.io.BufferedReader;import java.io.File;import java.io.FileInputStream;import java.io.FileNotFoundException;import java.io.FileReader;import java.io.IOException;import j原创 2015-12-17 21:21:28 · 1127 阅读 · 0 评论 -
使用C++实现simplex算法
代码如下:#include#includeusing namespace std;#define M 10000//全局变量 float kernel[11][31];//核心矩阵表 int m = 0, n = 0, t = 0;//m:结构向量的个数 //n:约束不等式个数 //t:目标函数类型:-1代表求求最小值,1代表求最大值 //输入接口函数转载 2015-11-26 22:47:03 · 1881 阅读 · 0 评论 -
哈弗曼编码对文件进行压缩解压
头文件:HuffmanCoding.h#ifndef HUFFMANCODING_H #define HUFFMANCODING_H #include #include "HuffTree.h" using namespace std;//栈结构 struct Link {unsigned int element;Link *next;Link(const转载 2015-11-01 00:20:11 · 722 阅读 · 0 评论 -
动态规划
动态规划题目:Say you have an array for which the i-th element is the price of a given stock on day i.Design an algorithm and implement it to nd the maximum pro t. You may complete at most two transactio原创 2015-11-15 23:37:46 · 335 阅读 · 0 评论 -
求逆序数
package hello;import java.io.BufferedReader;import java.io.FileNotFoundException;import java.io.FileReader;import java.io.FileWriter;import java.io.IOException;import javax.imageio.plugins.bmp.B原创 2015-11-02 22:26:40 · 448 阅读 · 0 评论 -
排序算法
插入排序 public static int helperSort(int[]nums,int left,int right){ int tem=nums[left]; while(left<right){ while(left=tem) right--; nums[left]=nums[right]; while (left<right && nums[le原创 2017-07-24 21:54:05 · 258 阅读 · 0 评论