- 博客(30)
- 收藏
- 关注
RSS订阅原创 系统分析与设计——第九次作业
1. 使用 ECB 实现 make reservation 用例的详细设计（包含用例简介，顺序图，类图）1.1. 用例简介 基本用例：{search, choose hotel, choose room type, confirm reservation, confirm shopping basket} 子用例：{select the check in date, select ...
2018-07-01 23:28:53
266
原创 系统分析与设计——第八次作业
1. 描述软件架构与框架之间的区别与联系1.1. 区别 软件架构（software architecture）是有关软件整体结构与组件的抽象描述，用于指导大型软件系统各个方面的设计。 软件框架（software framework）通常指的是为了实现某个业界标准或完成特定基本任务的软件组件规范，也指为了实现某个软件组件规范时，提供规范所要求之基础功能的软件产品。1.2. 联...
2018-06-09 01:18:13
315
原创 系统分析与设计——第七次作业
1. 题目的链接https://chickendinner8.github.io/2018/05/11/%E7%AC%BA%E7%AC%BA%E5%BB%BA%E6%A8%A1%E7%BB%83%E4%B9%A0.html2. 建模2.1. 用例图2.2. 添加书摘的活动图2.3. 领域模型2.4. 美句对象的状态图2.5. 添加书摘场景的系...
2018-05-13 23:42:53
240
原创 系统分析与设计——第六次作业
建模工具： UMLet 14.1.1 stand-alone1）使用 UML State Model建模对象： 参考 Asg_RH 文档， 对 Reservation/Order 对象建模。建模要求： 参考练习不能提供足够信息帮助你对订单对象建模，请参考现在 定旅馆 的旅游网站，尽可能分析围绕订单发生的各种情况，直到订单通过销售事件（柜台销售）结束订单。 2）研究淘宝退货流...
2018-05-07 02:53:25
213
原创 系统分析与设计——第五次作业
1、领域建模a. 阅读 Asg_RH 文档，按用例构建领域模型。按 Task2 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸说明：请不要受 PCMEF 层次结构影响。你需要识别实体（E）和 中介实体（M，也称状态实体） 在单页面应用（如 vue）中，E 一般与数据库构建有关， M 一般与 store 模式 有关在 java web 应用中，E 一般与数据库构...
2018-04-29 23:39:16
149
原创 系统分析与设计——第四次作业
1、用例建模a. 阅读 Asg_RH 文档，绘制用例图。 按 Task1 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸。b. 选择你熟悉的定旅馆在线服务系统（或移动 APP），如绘制用例图。并满足以下要求：- 对比 Asg_RH 用例图，请用色彩标注出创新用例或子用例。- 尽可能识别外部系统，并用色彩标注新的外部系统和服务。大众点评定旅馆...
2018-04-22 01:50:08
222
原创 跨站请求伪造（CSRF）的防护措施
跨站请求伪造（CSRF）的防护措施CSRF的简介跨站请求伪造（Cross-Site Request Forgery, CSRF），也被称为 one-click attack 或者 session riding， 是一种挟制用户在当前已登录的Web应用程序上执行非本意的操作的攻击方法。简单地说，CSRF 利用的就是网站对用户网页浏览器的信任。CSRF的攻击实例假如一家银行用...
2018-04-15 23:37:40
1843
原创 系统分析与设计——第二次作业
1. 简答题简述瀑布模型、增量模型、螺旋模型（含原型方法）的优缺点。 模型 优点 缺点 瀑布模型 1.降低软件开发的复杂程度，提高软件开发过程的透明性，提高软件开发过程的可管理性；2.推迟软件实现，强调在软件实现前必须进行分析和设计工作；3.以项目的阶段评审和文档控制为手段有效地对整个开发过程进行指导，保证了阶段之间的正确衔接，能够及时发现并纠正开发过程中...
2018-03-22 22:30:51
211
原创 系统分析与设计——第一次作业
一、简单题软件工程的定义——IEEE[IEE93] (1) 将系统化、规范化、可度量的方法应用于软件的开发、运行和维护的过程,即将工程化应用于软件中。(2) 对(1)中所述方法的研究。——其它定义 是指导计算机软件开发和维护的工程学科。采用工程的概念、原理、技术和方法来开发与维护软件,把经过实践考验而证明正确的管理技术和当前能够得到的最好的技术方法结合起来,这就是软件工程。...
2018-03-15 23:02:48
328
原创 330. Patching Array
Description:Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n]inclusive can be formed by the sum of some el
2018-01-21 21:58:43
253
原创 42. Trapping Rain Water
Description:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,
2018-01-21 21:03:46
146
原创 213. House Robber II
Description:Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much at
2018-01-21 19:30:12
119
原创 198. House Robber
Description:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is t
2018-01-21 18:53:06
109
原创 NP-8.8
8.8. In the EXACT 4 SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals, and such that each variable occurs at most once in each clause. The goal is to
2017-12-31 20:32:38
140
原创 338. Counting Bits
Description:Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Examp
2017-12-24 20:17:17
133
原创 11. Container With Most Water
Description: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)
2017-12-24 18:19:50
137
原创 64. Minimum Path Sum
Description:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either
2017-12-10 14:28:53
109
原创 63. Unique Paths II
Description:Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively
2017-11-29 11:10:56
114
原创 139. Word Break
Description: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
2017-11-22 20:04:21
158
原创 300. Longest Increasing Subsequence
Description:Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2
2017-11-14 12:05:19
127
原创 62. Unique Paths
Description: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 tryi
2017-11-09 14:37:55
122
原创 621. Task Scheduler
Description:Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order.
2017-11-05 21:22:50
116
原创 392. Is Subsequence
Description:Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length
2017-10-31 11:19:14
160
原创 406. Queue Reconstruction by Height
Descriptionheight of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.Note:The n
2017-10-22 15:24:06
159
原创 684. Redundant Connection
Description:In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, ..., N
2017-10-15 23:15:35
182
原创 98. Validate Binary Search Tree
Description:Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than
2017-10-06 01:14:32
217
原创 210. Course Schedule II
Description: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, whic
2017-09-25 23:05:31
185
原创 207. Course Schedule
Description: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, whic
2017-09-24 14:05:55
152
原创 32. Longest Valid Parentheses
Description:Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses sub
2017-09-17 00:34:07
135
原创 22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()((
2017-09-10 20:29:16
116
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人