- 博客(20)
- 收藏
- 关注
原创 Software SystemAnalysis and Design:用例建模-业务建模
使用UMLet建模:根据丁璐管建模文档,Asg-RH.pdf:绘制用例图模型(到子用例)给出make reservation用例的活动图用例图模型
2019-06-05 08:15:13 235
原创 Software System Analysis and Design:用例建模-绘制用例图
简答题用例的概念用例是软件工程或系统工程中对系统如何反应外界请求得描述,是一种通过用户的使用场景来获取需求的技术;每个用例提供了一个或多个场景,该场景说明了系统是如何和最终用户或其他系统互动的,也就是谁可以用系统做什么,从而获得一个明确的业务目标;用例是在不展现一个系统或子系统内部结构的情况下,对系统或子系统的某个连贯的功能单元的定义和描述;用例是一系列相关的成功和失败场景的集合,这些...
2019-06-02 18:37:01 567
原创 Software Analysis and Design:软件项目过程模型与规划
Software Analysis and Design:软件项目过程模型与规划
2019-04-19 22:59:55 241
原创 Software System Analysis and Design:软件的本质与软件工程科学
简答题1. 软件工程定义软件工程是:(1)应用系统的、有规律的、可量化的方法开发、操作和维护软件,即对软件应用工程化的方法;(2)对于(1)中方法的研究。2. 解释导致software crisis的本质原因、表现,述说克服软件危机的方法软件危机(Software Crisis)是计算机软件在它的开发和维护过程中所遇到的一系列严重问题。由于计算机硬件技术的进步,一些复杂的、大型的软件开...
2019-03-21 19:20:00 230
原创 使用爬山算法和基因算法解决固定容量设备选址问题
一、固定容量设备选址问题(Capacitated Facility Location Problem)问题定义:假定有nnn个仓库(facility)和mmm个顾客(customer),一个仓库可以服务多个顾客,但是每个顾客只能从一个仓库处得到服务。每个顾客有一定的需求量(demand),每个仓库有固定的供应量(capacity),每个仓库服务所有顾客的总需求量不能超过其供应量。若一个仓库没有服...
2018-12-23 23:19:25 586
原创 leetcode [Dynamic Programming] No.231 House Robber II
问题描述You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first hous...
2018-12-02 16:32:38 232 1
原创 leetcode [Dynamic Programming] No.343 Integer Break
问题描述Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.Example 1:Input: 2Output...
2018-11-26 01:29:47 135
原创 leetconde [Dynamic Programming] No.300 Longest Increasing Subsequence
问题描述Given an unsorted array of integers, find the length of longest increasing subsequence.Example:Input: [10,9,2,5,3,7,101,18]Output: 4Explanation: The longest increasing subsequence is [2,3,7,...
2018-11-14 15:28:58 193
原创 leetcode [Dynamic Programming] No.221 Maximal Square
问题描述Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.Example:Input:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0Output: 4解题思路思路一...
2018-11-08 10:51:02 140
原创 leetcode [Dynamic Programming] No.63 Unique Path II
问题描述A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach th...
2018-10-28 21:53:08 162
原创 leetcode [Greedy] No.45 Jump Game II
题目描述Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is t...
2018-10-21 16:40:45 142
原创 leetcode [Divide and Conquer] No.241 Different Ways to Add Parentheses
问题描述Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.Example1:...
2018-10-14 17:40:09 133
原创 leetcode [Graph] No.785 Is Graph Bipartite?
题目描述Given an undirected graph, return true if and only if it is bipartite.Recall that a graph is bipartite if we can split it’s set of nodes into two independent subsets A and B such that every edge...
2018-10-07 21:33:35 225
原创 leetcode [Graph] No.207 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 expressed as a ...
2018-09-30 05:51:50 152
原创 leetcode [Graph] No.743 Network Delay Time
题目描述There are N network nodes, labelled 1 to N.Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target node, and w is the time it take...
2018-09-23 20:48:19 237
原创 leetcode [Divide and Conquer] No.315 Count of Smaller Numbers After Self
题目描述You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].Examp...
2018-09-16 15:03:16 279
原创 leetcode [array] No.11 Container With Most Water
题目描述Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find...
2018-09-09 16:50:23 161
原创 unity3d-homework6-巡逻兵
欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来,用它写博客,将会带来全新的体验哦:Markdown和扩展Markdown简洁的语法代码块高亮图片链接和图片上传LaTex数学公式UML序列图和流程图离线写博客导入导出Markdown文件丰富的快捷键快捷键加粗 Ctrl + B 斜体 Ctrl + I
2018-05-11 23:03:58 197
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人