- 博客(31)
- 收藏
- 关注
RSS订阅原创 差分约束建边方法
1.求最大值，用最短路，不等式转化成 a <= b + c形式，从b向a建立权值为c的边g[b].append((a,c))2.求最小值，用最长路，不等式转化成a >= b + c形式，从b向a建立权值为c的边。
2023-12-14 18:36:39
84
1翻译 spring-boot 热替换（hot swapping）
文档相关内容：https://docs.spring.io/spring-boot/docs/current/reference/html/using-boot-devtools.htmlpom中引入如下依赖：<dependencies> <dependency> <groupId>org.springframework.boot</groupId&...
2018-05-22 14:46:07
2760
原创 @SpringBootApplication 注解的使用
com +- example +- myapplication +- Application.java | +- customer | +- Customer.java | +- CustomerController.java | +- CustomerService...
2018-05-21 16:25:24
269
原创 spark mllib 协同过滤
package com.vic.crm.ifib.recomimport org.apache.log4j.Levelimport org.apache.log4j.Loggerimport org.apache.spark.SparkConfimport org.apache.spark.SparkContextimport org.apache.spark.mllib.recomm
2017-06-27 17:23:30
269
原创 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 station i to
2015-01-04 19:39:46
386
原创 Trapping Rain Water
import java.util.Stack;public class Solution { public int trap(int[] A) { if(null == A || A.length < 3) return 0; int sum = 0,i = 0; Stack stack = new Stack(); while(i < A.length){ if(
2014-12-13 14:00:00
408
原创 Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get
2014-12-11 22:06:55
325
原创 Find Peak Element
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in
2014-12-11 20:21:05
447
原创 进制转换
import java.util.Scanner;public class Main { static void convert(int n,int r) { int[] a = new int[8]; int i = 0; for(; i < 8 && n != 0; i++) { a[i] = n % r; n = n / r; } i--;
2014-11-20 18:49:27
400
原创 字符所有组合
package com.vic.string;import java.util.ArrayList;import java.util.List;public class Combination { private static int count = 0; static void combination(char[] s){ for(int i=1;i<=s.length;i++
2014-11-09 21:22:15
387
原创 字符串全排列
package com.vic.string;public class Permutation { private static int count = 0; static void permutation(char[] s,int start){ if(start==s.length){ System.out.println(new String(s).toString());
2014-11-08 22:52:06
334
原创 二叉搜索树的后序遍历
package com.vic.tree;/** * 二叉搜索树的后序遍历 * @author Administrator * */public class SequenceOfBST{ static boolean verifySquenceOfBST(int[] sequence,int start,int end){ if(null==sequence||(end-star
2014-11-07 19:29:48
377
原创 二叉树中和为某一值的路径
import java.util.Iterator;import java.util.Scanner;import java.util.Vector;/** * 二叉树中和为某一值的路径 * @author Administrator * */public class FindPath { static void findPath(BinaryTree root,int exp
2014-11-07 17:11:57
364
原创 二叉树的层次遍历
package com.vic.tree;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;/** * 层次遍历二叉树 * @author Administrator * */public class BFSTree { static void BFS(BinaryTree
2014-11-07 10:57:57
470
原创 栈的压入弹出序列
import java.util.Stack;/** * 判断出栈序列是否可能 * * @author VIC * */public class IsPopSeq { /** * * @param pPush 给定的入栈序列 * @param pPop 需要判断是否可能的出栈序列 * @return */ public static boolean i
2014-11-07 10:17:50
363
转载 java 遍历map同时删除元素
import java.util.HashMap;import java.util.Iterator;import java.util.Map;public class HashMapTest { private static Map map=new HashMap(); /** 1.HashMap 类映射不保证顺序；某
2014-11-05 22:42:11
643
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人