<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cai_yt_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cai_yt_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cai_yt_]]></copyright><item><title><![CDATA[【系统分析与设计】9]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/80875894</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/80875894</guid><author>cai_yt_</author><pubDate>Sun, 01 Jul 2018 18:45:23 +0800</pubDate><description><![CDATA[1.  使用ECB实现 make reservation 用例的详细设计（包含用例简介，顺序图，类图）用例简介：根据以上用例，可以识别得到以下类：Boundary/UI 类：1. SearchHotelPage: 搜索宾馆界面2. MakeReservationPage: 预定宾馆界面3. BasketPage: 购物车界面4. PayPage: 支付界面Controller 类：Controll...]]></description><category></category></item><item><title><![CDATA[【系统分析与设计】8]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/80628811</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/80628811</guid><author>cai_yt_</author><pubDate>Fri, 08 Jun 2018 22:29:32 +0800</pubDate><description><![CDATA[描述软件架构与框架之间的区别与联系以你的项目为案例绘制三层架构模型图，细致到分区结合你程序的结构，从程序员角度说明三层架构给开发者带来的便利研究 VUE 与 Flux 状态管理的异同...]]></description><category></category></item><item><title><![CDATA[【系统分析与设计】7]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/80304229</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/80304229</guid><author>cai_yt_</author><pubDate>Sun, 13 May 2018 23:30:48 +0800</pubDate><description><![CDATA[建模要求包括（用例图、XX业务或用例的活动图、XX领域模型、XX对象的状态图、XX场景的系统顺序图与操作协议）用例图活动图领域模型状态图场景的系统顺序图...]]></description><category></category></item><item><title><![CDATA[【系统分析与设计】6]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/80219922</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/80219922</guid><author>cai_yt_</author><pubDate>Sun, 06 May 2018 23:12:44 +0800</pubDate><description><![CDATA[1）使用 UML State Model建模对象： 参考 Asg_RH 文档， 对 Reservation/Order 对象建模。 建模要求： 参考练习不能提供足够信息帮助你对订单对象建模，请参考现在 定旅馆 的旅游网站，尽可能分析围绕订单发生的各种情况，直到订单通过销售事件（柜台销售）结束订单。 2）研究淘宝退货流程活动图，对退货业务对象状态建模 ...]]></description><category></category></item><item><title><![CDATA[【系统分析与设计】5]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/80146457</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/80146457</guid><author>cai_yt_</author><pubDate>Sun, 29 Apr 2018 23:11:02 +0800</pubDate><description><![CDATA[领域建模


a. 阅读 Asg_RH 文档，按用例构建领域模型。

按 Task2 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸

说明：请不要受 PCMEF 层次结构影响。你需要识别实体（E）和 中介实体（M，也称状态实体）

在单页面应用（如 vue）中，E 一般与数据库构建有关， M 一般与 store 模式 有关

在 java web 应用中，]]></description><category></category></item><item><title><![CDATA[【系统设计与分析】4]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/80044406</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/80044406</guid><author>cai_yt_</author><pubDate>Sun, 22 Apr 2018 23:27:07 +0800</pubDate><description><![CDATA[1、 用例建模


a. 阅读 Asg_RH 文档，绘制用例图。 按 Task1 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸
       





b. 选择你熟悉的定旅馆在线服务系统（或移动 APP），如绘制用例图。并满足以下要求：

- 对比 Asg_RH 用例图，请用色彩标注出创新用例或子用例

- 尽可能识别外部系统，并用色彩标注新的外]]></description><category></category></item><item><title><![CDATA[【系分】微信小程序开发入门（一）]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79954188</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79954188</guid><author>cai_yt_</author><pubDate>Sun, 15 Apr 2018 22:25:52 +0800</pubDate><description><![CDATA[开发准备微信小程序官方教程下载开发工具 正式开发1.   添加项目，输入AppID，选择项目目录创建新文件夹，若文件夹为空，系统就会自动创建整个项目架构【注意：记得勾选quickstart项目】 2.   自动创建的项目有以下架构目录：菜单栏，页面效果显示，代码架构目录，代码栏着重讲解代码架构目录：app.js、app.json、app.wxss app.js是小程序的脚本代码。我们可以在这个文件...]]></description><category></category></item><item><title><![CDATA[【系统分析与设计】2]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79654679</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79654679</guid><author>cai_yt_</author><pubDate>Thu, 22 Mar 2018 15:20:51 +0800</pubDate><description><![CDATA[1 简答题简述瀑布模型、增量模型、螺旋模型（含原型方法）的优缺点。·   瀑布模型的优点：1. 可强迫开发人员采用规范的方法；2. 严格规定了每个阶段必须提交的文档；3. 要求每个阶段交出的所有产品都必须经过质量保证小组的仔细验证。 ·   瀑布模型的缺点：1. 在软件开发初期，指明用户全部需求是困难的；2. 需求确定后，经过一段时间才得到软件最初版本；3. 完全依赖规格说明，导致不能满足用户需求...]]></description><category></category></item><item><title><![CDATA[【系统分析与设计】1]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79573404</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79573404</guid><author>cai_yt_</author><pubDate>Thu, 15 Mar 2018 20:30:13 +0800</pubDate><description><![CDATA[1简单题1.1  软件工程的定义From Wiki: Software engineering is “(1) the application of a systematic,disciplined, quantifiable approach to the development, operation, andmaintenance of software, that is, the appli...]]></description><category></category></item><item><title><![CDATA[Algorithms（十六）Permutations II]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79051929</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79051929</guid><author>cai_yt_</author><pubDate>Sat, 13 Jan 2018 15:58:41 +0800</pubDate><description><![CDATA[题目：

47. Permutations II

Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example,
[1,1,2] have the following unique permutations:

[
]]></description><category></category></item><item><title><![CDATA[Algorithms（十五）Permutations]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79051374</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79051374</guid><author>cai_yt_</author><pubDate>Sat, 13 Jan 2018 14:47:22 +0800</pubDate><description><![CDATA[题目：

46. Permutations

Given a collection of distinct numbers, return all possible permutations.
For example,
[1,2,3] have the following permutations:

[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,]]></description><category></category></item><item><title><![CDATA[Algorithms（十四）Pow(x, n)]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79049133</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79049133</guid><author>cai_yt_</author><pubDate>Sat, 13 Jan 2018 01:29:52 +0800</pubDate><description><![CDATA[题目：

50. Pow(x, n)

Implement 
pow(x, n).

Example 1:
Input: 2.00000, 10
Output: 1024.00000

Example 2:
Input: 2.10000, 3
Output: 9.26100

代码：

class Solution {
public:
    double myPow(d]]></description><category></category></item><item><title><![CDATA[Algorithms（十三）Kth Smallest Element in a BST]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79048430</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79048430</guid><author>cai_yt_</author><pubDate>Fri, 12 Jan 2018 21:47:21 +0800</pubDate><description><![CDATA[题目：

230. Kth Smallest Element in a BST


Given a binary search tree, write a function kthSmallest to find the
kth smallest element in it.
Note: 
You may assume k is always valid, 1 ≤ k ≤ BST']]></description><category></category></item><item><title><![CDATA[Algorithms（十二）Best Time to Buy and Sell Stock III]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79048344</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79048344</guid><author>cai_yt_</author><pubDate>Fri, 12 Jan 2018 21:35:56 +0800</pubDate><description><![CDATA[题目：

123. Best Time to Buy and Sell Stock III


Say you have an array for which the ith element is the price of a given stock on dayi.
Design an algorithm to find the maximum profit. You may com]]></description><category></category></item><item><title><![CDATA[Algorithms（十一）Unique Paths II]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79047565</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79047565</guid><author>cai_yt_</author><pubDate>Fri, 12 Jan 2018 19:41:43 +0800</pubDate><description><![CDATA[题目：

63. Unique Paths II


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 ]]></description><category></category></item><item><title><![CDATA[Algorithms（十）Unique Paths]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79044946</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79044946</guid><author>cai_yt_</author><pubDate>Fri, 12 Jan 2018 15:48:25 +0800</pubDate><description><![CDATA[题目：

62. Unique Paths


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 ro]]></description><category></category></item><item><title><![CDATA[Algorithms（九）Jump Game II]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79039883</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79039883</guid><author>cai_yt_</author><pubDate>Fri, 12 Jan 2018 02:12:24 +0800</pubDate><description><![CDATA[题目：

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 th]]></description><category></category></item><item><title><![CDATA[Algorithms（八）Jump Game]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/79039878</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/79039878</guid><author>cai_yt_</author><pubDate>Fri, 12 Jan 2018 01:58:38 +0800</pubDate><description><![CDATA[题目：

55. Jump Game


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 ]]></description><category></category></item><item><title><![CDATA[Algorithms（七）Single Number]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/78982049</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/78982049</guid><author>cai_yt_</author><pubDate>Fri, 05 Jan 2018 15:39:33 +0800</pubDate><description><![CDATA[题目：


136. Single Number


Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you]]></description><category></category></item><item><title><![CDATA[Algorithms（六）Best Time to Buy and Sell Stock II]]></title><link>https://blog.youkuaiyun.com/cai_yt_/article/details/78927605</link><guid>https://blog.youkuaiyun.com/cai_yt_/article/details/78927605</guid><author>cai_yt_</author><pubDate>Fri, 29 Dec 2017 00:17:57 +0800</pubDate><description><![CDATA[题目：

122. Best Time to Buy and Sell Stock II

Say you have an array for which the ith element is the price of a given stock on day
i.
Design an algorithm to find the maximum profit. You may comp]]></description><category></category></item></channel></rss>