- 博客(12)
- 收藏
- 关注
RSS订阅原创 Test
API mock stockService = mock(StockService.class); when thenReturn when(a.fun()).thenReturn(); @RunWith @Mock @InjectMocks Assert.assertEquals()
2020-01-08 06:54:44
407
原创 [Scala]
match: equals to switch https://docs.scala-lang.org/tour/pattern-matching.html 什么都看API就够了 https://www.scala-lang.org/api/2.7.0/scala/List.html#%3A%3A%28B%29
2019-10-22 12:20:03
102
原创 Guice
This article is from this tutorial: Google Guice What is module 1.A module contributes configuration information, typically interface bindings, which will be used to create an injector. 2.Your module ...
2019-09-25 06:14:58
323
原创 Design Patterns
Tools UML lab Use a umllab trial in eclipse UML Lab 关系图总结 Strategy Pattern / Policy Pattern In computer programming, the strategy pattern (also known as the policy pattern) is a behavioral software...
2019-09-21 05:53:02
563
原创 Java
https://stackoverflow.com/questions/2589741/what-is-more-efficient-system-arraycopy-or-arrays-copyof
2019-09-21 05:10:08
87
原创 [Data Structure] Binary Tree
binary tree iterator https://leetcode.com/problems/binary-search-tree-iterator/
2019-09-17 11:34:15
108
原创 [Data Structure] Stack and Heap
文章目录StackDecode and Encode String Stack Decode and Encode String https://leetcode.com/problems/valid-parentheses/ input: ‘([)]’ output: True or False 多种括号问题，容易错，还是得用stack，用count是不行的。。。 Trapping Rain ...
2019-09-17 11:33:47
237
原创 Python
文章目录OOPAbstract ClassString Manipulation OOP Abstract Class create abstract class in python from abc import ABC, abstractmethod class AbstractOperation(ABC): def __init__(self, operand_a, opera...
2019-09-17 10:43:05
74
原创 [Data Structure] DFS
好好看一下这个文档，对方是怎么define union find这个API的 https://python-algorithms.readthedocs.io/en/stable/_modules/python_algorithms/basic/union_find.html
2019-09-17 10:19:10
84
原创 Git
change nodes in branches A -- B -- C (Master) \ D -- E (NewBranch) change to A -- B -- C -- D (Master) \ E (NewBranch) git checkout Master git merge Ne...
2019-09-17 10:15:13
356
原创 易错集
Array 双array iterate while ...: if i >= m or arr[i] < arr[j]: // 这一步如果i < m但是j >= n, 第二个判断会out of bound ... else: ...
2019-08-13 00:35:52
84
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人