weblogic卸载
公司最近有项目是关于webogic的安装配置的问题，在实践过程中，因为是第一次自己独立安装，所以来来回回不断安装卸载了还多次，关于weblogic的卸载，以下是本人在项目过程中，通过搜索资料整理出的较完整的weblogic的卸载，经本人已全面测试，现列举出来，一是为自己整理出来方便日后整理查阅，二是，给有需要的人，可供参考：
首先卸载weblogic，须执行卸载文件un...
彻底删除weblogic的domain
https://www.cnblogs.com/jinhai-wow/p/8513510.html
删除 D:\Oracle\Middleware\wlserver_10.3\common\nodemanager\nodemanager.domains 里的domain1域内容：
#Domains and directories created by Configuration Wi...
idea2018下载-补丁破解激活
破解补丁为 Rover12421 开发，使用方法如下：
下载 http://idea.lanyus.com/jar/JetbrainsCrack-2.6.2.jar 并将 JetbrainsCrack-2.6.2.jar 放置到 D盘根目录。
在 IntelliJ IDEA 安装目录中找到 idea.exe.vmoptions 和 idea64.exe.vmoptions ，以文本格式打开并同时...
JetbrainsCrack-2.10 idea-破解所需jar包
navicat_premium
[添加链接描述](https://pan.baidu.com/s/1G75IoQNvfcYrXkpI2H5stw)
提取码:4ham
Golang 通过net/smtp发送邮件 在正文中添加图片(附件/非附件)
背景
遇到一个需求 需要发送带有图片的邮件
于是参考:http://www.cnblogs.com/zengchunyun/p/9485444.html
完成了带图片附件的邮件发送功能
但是！！
产品竟然说 图片需要在正文里！！正文！！ 个人觉得在附件里很好呀0.0
尝试
产品说什么就是什么吧。。
于是疯狂尝试怎么把图片从附件里显示到正文当中
multipart类型，...
golang interface{}类型转换 bson.M 遇到莫名其妙的问题
背景
从mongo数据库中取出数据以interface{}格式返回，解析返回的数据。
1.从mongo中取数据
newSession := m.Session.Copy()
defer newSession.Close()
c := newSession.DB(database).C(collName)
if err := c.Find(bson.M{"time": occurtime}).One...
LeetCode-深度优先搜索-esay
LeetCode-深度优先搜索-esay
记录了初步解题思路 以及本地实现代码；并不一定为最优 也希望大家能一起探讨 一起进步
目录LeetCode-深度优先搜索-esay100. Same Tree 相同的树101. Symmetric Tree 对称二叉树104. Maximum Depth of Binary Tree 二叉树的最大深度108. Convert Sorted Arra...
【LeetCode】139. Word Break
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
Note:
The ...
【LeetCode】130. Surrounded Regions
Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.
A region is captured by flipping all 'O's into 'X's in that surrounded region.
Example:
X X X X
X O O...
【LeetCode】132. Palindrome Partitioning II
Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s.
Example:
Input: "aab"
Output: 1
Explana...
【LeetCode】133. Clone Graph
Given the head of a graph, return a deep copy (clone) of the graph. Each node in the graph contains a label (int) and a list (List[UndirectedGraphNode]) of its neighbors. There is an edge between the ...
【LeetCode】134. 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 its ...
【LeetCode】138. Copy List with Random Pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.
Return a deep copy of the list.
题解：复制一个随机链表，本题复制时先用map标记原地址到复制地址的映...
【LeetCode】260. Single Number III
题目：
Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
Note:
Your algorithm should have a linear runtime complex...
【LeetCode】129. Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the tota...
【LeetCode】128. Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
Your algorithm should run in O(n) complexity.
Example:
Input: [100, 4, 200, 1, 3, 2]
Output: 4
Ex...
【LeetCode】Triangle
Given 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
[
[2],
[3,4],
[6,5...
【LeetCode】Distinct Subsequences
Example 1:
Input: S = "rabbbit", T = "rabbit"
Output: 3
Explanation:
As shown below, there are 3 ways you can generate "rabbit" from S.
(The caret symbol ^ means the chosen letters)
rabbbit
^^^^ ^...
堆排序（Heap Sort）算法
目录
1、关于堆的相关定义
2、关于堆排序算法的基本过程
3、堆排序算法的代码实现
1、关于堆的相关定义
(二叉)堆数据结构是一种数组对象，其可视为一颗完全二叉树，树的每一层都是填满的，最后一层除外（最后一层从一个结点的左子树开始填）。表示堆得数组A是一个具有两个属性的对象：length[A]是数组中的元素的个数， heap_size[A]是存放在A中的堆元素个数。就是说虽然A[1...
今日推荐
周排行