step by step to OpenFOAM:step1
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了step by step to OpenFOAM:step1相关的知识,希望对你有一定的参考价值。
参考技术A \1. Install blueCFD-Core-2017-2-win64-setup.exe\2. 打开 blueCFD-Core terminal
\3. cd /blueCFD/ofuser-of5
\4. mkdir run 创建工作目录
\5. 将目录\blueCFD-Core-2017 \OpenFOAM-5.x \tutorials\ incompressible \icoFoam \cavity\cavity
拷贝到run目录下
\6. cd cavity 切换到cavity工作目录下
\7. tree 查看文件目录树,这个步骤可省略
\8. cat system/blockMeshDict 查看网格设置,这个步骤可省略
\9. blockMesh 生成网格
这是在cavity/constant目录下回多个文件夹polyMesh里面包含了生成网格的信息
\10. checkMesh 检查网格,这一步
\11. icoFoam 调用求解器计算,使用不可压缩格式计算
\12. paraFoam 打开后处理paraview查看结果
leetcode1413. Minimum Value to Get Positive Step by Step Sum
题目如下:
Given an array of integers
nums
, you start with an initial positive value startValue.In each iteration, you calculate the step by step sum of startValue plus elements in
nums
(from left to right).Return the minimum positive value of startValue such that the step by step sum is never less than 1.
Example 1:
Input: nums = [-3,2,-3,4,2] Output: 5 Explanation: If you choose startValue = 4, in the third iteration your step by step sum is less than 1. step by step sum startValue = 4 | startValue = 5 | nums (4 -3 ) = 1 | (5 -3 ) = 2 | -3 (1 +2 ) = 3 | (2 +2 ) = 4 | 2 (3 -3 ) = 0 | (4 -3 ) = 1 | -3 (0 +4 ) = 4 | (1 +4 ) = 5 | 4 (4 +2 ) = 6 | (5 +2 ) = 7 | 2Example 2:
Input: nums = [1,2] Output: 1 Explanation: Minimum start value should be positive.Example 3:
Input: nums = [1,-2,-3] Output: 5Constraints:
1 <= nums.length <= 100
-100 <= nums[i] <= 100
解题思路:从左往右依次累加nums的和,如果遇到和为负数的情况,只要保证 startValue = min(负数和) + 1 即可;如果全为正数,startValue = 1。
代码如下:
class Solution(object): def minStartValue(self, nums): """ :type nums: List[int] :rtype: int """ min_val = float(‘inf‘) amount = 0 for i in nums: amount += i min_val = min(min_val,amount) if min_val >= 1:return 1 else:return abs(min_val) + 1
以上是关于step by step to OpenFOAM:step1的主要内容,如果未能解决你的问题,请参考以下文章
[Transducer] Step by Step to build a simple transducer
step by step guide tell you how to build a website
leetcode1413. Minimum Value to Get Positive Step by Step Sum
leetcode1413. Minimum Value to Get Positive Step by Step Sum
EGit with eclipse to clone project from GitHub(Step by step)
LeetCode --- 1413. Minimum Value to Get Positive Step by Step Sum 解题报告