llbzow/llbzow.github.io
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
670e34511d379949e5fca97417bb5ef1e201de17
llbzow.github.io/2022/11/02/软件技术基础的前两次实验/index.html
llbzow 670e34511d Site updated: 2022-11-15 17:07:24
2022-11-15 17:07:25 +00:00

525 lines
38 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<!DOCTYPE html>
<html lang="zh-CN">
<head>
<script src="/live2d-widget/autoload.js"></script>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=2">
<meta name="theme-color" content="#222">
<meta name="generator" content="Hexo 6.2.0">
<link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
<link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
<link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
<link rel="mask-icon" href="/images/logo.svg" color="#222">
<link rel="stylesheet" href="/css/main.css">
<link rel="stylesheet" href="/lib/font-awesome/css/all.min.css">
<link rel="stylesheet" href="/lib/pace/pace-theme-minimal.min.css">
<script src="/lib/pace/pace.min.js"></script>
<script id="hexo-configurations">
var NexT = window.NexT || {};
var CONFIG = {"hostname":"example.com","root":"/","scheme":"Gemini","version":"7.8.0","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12,"onmobile":false},"copycode":{"enable":false,"show_result":false,"style":null},"back2top":{"enable":true,"sidebar":false,"scrollpercent":false},"bookmark":{"enable":false,"color":"#222","save":"auto"},"fancybox":false,"mediumzoom":false,"lazyload":false,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"algolia":{"hits":{"per_page":10},"labels":{"input_placeholder":"Search for Posts","hits_empty":"We didn't find any results for the search: ${query}","hits_stats":"${hits} results found in ${time} ms"}},"localsearch":{"enable":false,"trigger":"auto","top_n_per_article":1,"unescape":false,"preload":false},"motion":{"enable":true,"async":false,"transition":{"post_block":"fadeIn","post_header":"slideDownIn","post_body":"slideDownIn","coll_header":"slideLeftIn","sidebar":"slideUpIn"}}};
</script>
<meta name="description" content="先放工程文件内容(工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本) 第一次实验提取密码：36w2。 第二次实验提取密码：s0z4。">
<meta property="og:type" content="article">
<meta property="og:title" content="软件技术基础的前两次实验">
<meta property="og:url" content="http://example.com/2022/11/02/%E8%BD%AF%E4%BB%B6%E6%8A%80%E6%9C%AF%E5%9F%BA%E7%A1%80%E7%9A%84%E5%89%8D%E4%B8%A4%E6%AC%A1%E5%AE%9E%E9%AA%8C/index.html">
<meta property="og:site_name" content="流量不足ow的个人博客">
<meta property="og:description" content="先放工程文件内容(工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本) 第一次实验提取密码：36w2。 第二次实验提取密码：s0z4。">
<meta property="og:locale" content="zh_CN">
<meta property="article:published_time" content="2022-11-02T02:31:10.000Z">
<meta property="article:modified_time" content="2022-11-08T15:49:48.670Z">
<meta property="article:author" content="llbzow">
<meta property="article:tag" content="软件技术基础">
<meta name="twitter:card" content="summary">
<link rel="canonical" href="http://example.com/2022/11/02/%E8%BD%AF%E4%BB%B6%E6%8A%80%E6%9C%AF%E5%9F%BA%E7%A1%80%E7%9A%84%E5%89%8D%E4%B8%A4%E6%AC%A1%E5%AE%9E%E9%AA%8C/">
<script id="page-configurations">
// https://hexo.io/docs/variables.html
CONFIG.page = {
sidebar: "",
isHome : false,
isPost : true,
lang : 'zh-CN'
};
</script>
<script>
(function () {
if ('') {
if (prompt('请输入文章密码') !== '') {
alert('密码错误！');
if (history.length === 1) {
location.replace("http://blog.llbzow.tk"); // 这里替换成你的首页
} else {
history.back();
}
}
}
})();
</script>
<title>软件技术基础的前两次实验 | 流量不足ow的个人博客</title>
<noscript>
<style>
.use-motion .brand,
.use-motion .menu-item,
.sidebar-inner,
.use-motion .post-block,
.use-motion .pagination,
.use-motion .comments,
.use-motion .post-header,
.use-motion .post-body,
.use-motion .collection-header { opacity: initial; }
.use-motion .site-title,
.use-motion .site-subtitle {
opacity: initial;
top: initial;
}
.use-motion .logo-line-before i { left: initial; }
.use-motion .logo-line-after i { right: initial; }
</style>
</noscript>
</head>
<body itemscope itemtype="http://schema.org/WebPage">
<div class="container use-motion">
<div class="headband"></div>
<header class="header" itemscope itemtype="http://schema.org/WPHeader">
<div class="header-inner"><div class="site-brand-container">
<div class="site-nav-toggle">
<div class="toggle" aria-label="切换导航栏">
<span class="toggle-line toggle-line-first"></span>
<span class="toggle-line toggle-line-middle"></span>
<span class="toggle-line toggle-line-last"></span>
</div>
</div>
<div class="site-meta">
<a href="/" class="brand" rel="start">
<span class="logo-line-before"><i></i></span>
<h1 class="site-title">流量不足ow的个人博客</h1>
<span class="logo-line-after"><i></i></span>
</a>
</div>
<div class="site-nav-right">
<div class="toggle popup-trigger">
</div>
</div>
</div>
<nav class="site-nav">
<ul id="menu" class="main-menu menu">
<li class="menu-item menu-item-home">
<a href="/" rel="section"><i class="fa fa-home fa-fw"></i>首页</a>
</li>
<li class="menu-item menu-item-about">
<a href="/about/" rel="section"><i class="fa fa-user fa-fw"></i>关于</a>
</li>
<li class="menu-item menu-item-tags">
<a href="/tags/" rel="section"><i class="fa fa-tags fa-fw"></i>标签</a>
</li>
<li class="menu-item menu-item-categories">
<a href="/categories/" rel="section"><i class="fa fa-th fa-fw"></i>分类</a>
</li>
<li class="menu-item menu-item-archives">
<a href="/archives/" rel="section"><i class="fa fa-archive fa-fw"></i>归档</a>
</li>
</ul>
</nav>
</div>
</header>
<div class="back-to-top">
<i class="fa fa-arrow-up"></i>
<span>0%</span>
</div>
<main class="main">
<div class="main-inner">
<div class="content-wrap">
<div class="content post posts-expand">
<article itemscope itemtype="http://schema.org/Article" class="post-block" lang="zh-CN">
<link itemprop="mainEntityOfPage" href="http://example.com/2022/11/02/%E8%BD%AF%E4%BB%B6%E6%8A%80%E6%9C%AF%E5%9F%BA%E7%A1%80%E7%9A%84%E5%89%8D%E4%B8%A4%E6%AC%A1%E5%AE%9E%E9%AA%8C/">
<span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
<meta itemprop="image" content="/images/avatar.png">
<meta itemprop="name" content="llbzow">
<meta itemprop="description" content="">
</span>
<span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
<meta itemprop="name" content="流量不足ow的个人博客">
</span>
<header class="post-header">
<h1 class="post-title" itemprop="name headline">
软件技术基础的前两次实验
</h1>
<div class="post-meta">
<span class="post-meta-item">
<span class="post-meta-item-icon">
<i class="far fa-calendar"></i>
</span>
<span class="post-meta-item-text">发表于</span>
<time title="创建时间：2022-11-02 10:31:10" itemprop="dateCreated datePublished" datetime="2022-11-02T10:31:10+08:00">2022-11-02</time>
</span>
<span class="post-meta-item">
<span class="post-meta-item-icon">
<i class="far fa-calendar-check"></i>
</span>
<span class="post-meta-item-text">更新于</span>
<time title="修改时间：2022-11-08 23:49:48" itemprop="dateModified" datetime="2022-11-08T23:49:48+08:00">2022-11-08</time>
</span>
<span class="post-meta-item">
<span class="post-meta-item-icon">
<i class="far fa-folder"></i>
</span>
<span class="post-meta-item-text">分类于</span>
<span itemprop="about" itemscope itemtype="http://schema.org/Thing">
<a href="/categories/C%E8%AF%AD%E8%A8%80/" itemprop="url" rel="index"><span itemprop="name">C语言</span></a>
</span>
</span>
<span class="post-meta-item" title="阅读次数" id="busuanzi_container_page_pv" style="display: none;">
<span class="post-meta-item-icon">
<i class="fa fa-eye"></i>
</span>
<span class="post-meta-item-text">阅读次数：</span>
<span id="busuanzi_value_page_pv"></span>
</span>
</div>
</header>
<div class="post-body" itemprop="articleBody">
<h2 id="先放工程文件内容-工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本"><a href="#先放工程文件内容-工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本" class="headerlink" title="先放工程文件内容(工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本)"></a>先放工程文件内容(工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本)</h2><ul>
<li><a target="_blank" rel="noopener" href="https://pan.baidu.com/s/1uaYXi43UArDlIUWvHhqAMg" title="第一次实验">第一次实验</a>提取密码：36w2。</li>
<li><a target="_blank" rel="noopener" href="https://pan.baidu.com/s/1D1z4xrakmmWYI3ETM1BzuQ" title="第二次实验">第二次实验</a>提取密码：s0z4。</li>
</ul>
<span id="more"></span>
<h3 id="第一次实验代码"><a href="#第一次实验代码" class="headerlink" title="第一次实验代码"></a>第一次实验代码</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br></pre></td><td class="code"><pre><span class="line">#include&lt;stdio.h&gt;</span><br><span class="line">#include&lt;string.h&gt;</span><br><span class="line">#include&lt;malloc.h&gt;</span><br><span class="line">#pragma warning(disable:4996)</span><br><span class="line">typedef struct student</span><br><span class="line">&#123;</span><br><span class="line"> int elem;</span><br><span class="line"> int num;</span><br><span class="line"> char name[20];</span><br><span class="line"> char adress[30];</span><br><span class="line"> char sex[20];</span><br><span class="line"> int year;</span><br><span class="line"> struct student *next;</span><br><span class="line">&#125;link;</span><br><span class="line">link * creatLink(int * initelem, int len) &#123;</span><br><span class="line"> int i;</span><br><span class="line"> //最初状态下，头指针 H 没有任何结点，所以，插入第一个元素，就相当于是创建结点 H</span><br><span class="line"> link *H = (link*)malloc(sizeof(link));</span><br><span class="line"> H-&gt;elem = initelem[0];</span><br><span class="line"> H-&gt;next = NULL;</span><br><span class="line"> //如果采用头插法插入超过 1 个元素，则可添加到第一个结点 H 之前</span><br><span class="line"> for (i = 1; i &lt; len; i++) &#123;</span><br><span class="line"> link * a = (link*)malloc(sizeof(link));</span><br><span class="line"> a-&gt;elem = initelem[i];</span><br><span class="line"> //插入元素时，首先将插入位置后的链表链接到新结点上</span><br><span class="line"> printf(&quot;学号：&quot;);</span><br><span class="line"> scanf(&quot;%d&quot;, &amp;(a-&gt;num));</span><br><span class="line"> printf(&quot;名字：&quot;);</span><br><span class="line"> scanf(&quot;%s&quot;, &amp;(a-&gt;name));</span><br><span class="line"> printf(&quot;地址：&quot;);</span><br><span class="line"> scanf(&quot;%s&quot;, &amp;(a-&gt;adress));</span><br><span class="line"> printf(&quot;性别（可填武装直升机）：&quot;);</span><br><span class="line"> scanf(&quot;%s&quot;, &amp;(a-&gt;sex));</span><br><span class="line"> printf(&quot;年龄：&quot;);</span><br><span class="line"> scanf(&quot;%d&quot;, &amp;(a-&gt;year));</span><br><span class="line"> printf(&quot;\n&quot;);</span><br><span class="line"> a-&gt;next = H;</span><br><span class="line"> //然后再链接头指针 H</span><br><span class="line"> H = a;</span><br><span class="line"> &#125;</span><br><span class="line"> return H;</span><br><span class="line">&#125;</span><br><span class="line">void display(struct student *p) &#123;</span><br><span class="line"> while (((p-&gt;elem) &gt; 1)&amp;&amp; ((p-&gt;elem) = 1)) &#123;</span><br><span class="line"> printf(&quot;学生：&quot;);</span><br><span class="line"> printf(&quot;%d\t&quot;, p-&gt;num);</span><br><span class="line"> printf(&quot;%s\t&quot;, p-&gt;name);</span><br><span class="line"> printf(&quot;%s\t&quot;, p-&gt;adress);</span><br><span class="line"> printf(&quot;%s\t&quot;, p-&gt;sex);</span><br><span class="line"> printf(&quot;%d\t&quot;, p-&gt;year);</span><br><span class="line"> printf(&quot;\n&quot;);</span><br><span class="line"> p = p-&gt;next;</span><br><span class="line"> &#125;</span><br><span class="line"> printf(&quot;\n&quot;);</span><br><span class="line">&#125;</span><br><span class="line">int main(void)</span><br><span class="line">&#123;</span><br><span class="line"> int a, i;</span><br><span class="line"> int elem[20] = &#123;1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20&#125;;</span><br><span class="line"> printf(&quot;结构体数目：&quot;);</span><br><span class="line"> scanf(&quot;%d&quot;, &amp;i);</span><br><span class="line"> link *Head = creatLink(elem,i+1);</span><br><span class="line"> display(Head);</span><br><span class="line"> system(&quot;pause&quot;);</span><br><span class="line"> return 0;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
<h3 id="第二次实验代码"><a href="#第二次实验代码" class="headerlink" title="第二次实验代码"></a>第二次实验代码</h3><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br></pre></td><td class="code"><pre><span class="line">#include&lt;stdio.h&gt;</span><br><span class="line">#include &lt;stdlib.h&gt;</span><br><span class="line">#include&lt;malloc.h&gt;</span><br><span class="line">#pragma warning (disable:4996)</span><br><span class="line">struct Node//结构体</span><br><span class="line">&#123;</span><br><span class="line"> char data;</span><br><span class="line"> struct Node* link;</span><br><span class="line">&#125;;</span><br><span class="line">struct Node* buildLinkedList(char* arr, int n) //尾插法初始化链表并插入元素的函数</span><br><span class="line">&#123;</span><br><span class="line"> struct Node*p, *pre, *head;</span><br><span class="line"> head = (struct Node*)malloc(sizeof(struct Node));</span><br><span class="line"> head-&gt;link = NULL;</span><br><span class="line"> pre = head;</span><br><span class="line"> for (int i = 0; i &lt; n; i++) &#123;</span><br><span class="line"> p = (struct Node*)malloc(sizeof(struct Node));</span><br><span class="line"> p-&gt;data = arr[i];</span><br><span class="line"> p-&gt;link = NULL;</span><br><span class="line"> pre-&gt;link = p;</span><br><span class="line"> pre = p;</span><br><span class="line"> &#125;</span><br><span class="line"> return head;</span><br><span class="line">&#125;</span><br><span class="line">struct Node* insertElem(Node * p, char elem, int add) // 插入函数</span><br><span class="line">&#123;</span><br><span class="line"> Node * temp = p;//创建临时结点temp</span><br><span class="line"> //首先找到要插入位置的上一个结点</span><br><span class="line"> for (int i = 2; i &lt; add*2; i++) &#123;</span><br><span class="line"> if (temp == NULL) &#123;</span><br><span class="line"> printf(&quot;插入位置无效\n&quot;);</span><br><span class="line"> return p;</span><br><span class="line"> &#125;</span><br><span class="line"> temp = temp-&gt;link;</span><br><span class="line"> &#125;</span><br><span class="line"> //创建插入结点c</span><br><span class="line"> Node * c = (Node*)malloc(sizeof(Node));</span><br><span class="line"> c-&gt;data = elem;</span><br><span class="line"> //向链表中插入结点</span><br><span class="line"> c-&gt;link = temp-&gt;link;</span><br><span class="line"> temp-&gt;link = c;</span><br><span class="line"> return p;</span><br><span class="line">&#125;</span><br><span class="line">struct Node * delElem(Node * p, int add) </span><br><span class="line">&#123;</span><br><span class="line"> Node * temp = p;</span><br><span class="line"> //temp指向被删除结点的上一个结点</span><br><span class="line"> for (int i = 2; i &lt; add*2; i++) &#123;</span><br><span class="line"> temp = temp-&gt;link;</span><br><span class="line"> &#125;</span><br><span class="line"> Node * del = temp-&gt;link;//单独设置一个指针指向被删除结点，以防丢失</span><br><span class="line"> temp-&gt;link = (temp-&gt;link)-&gt;link;//删除某个结点的方法就是更改前一个结点的指针域</span><br><span class="line"> free(del);//手动释放该结点，防止内存泄漏</span><br><span class="line"> return p;</span><br><span class="line">&#125;</span><br><span class="line">void printLinkedList(struct Node* head) //打印链表的函数</span><br><span class="line">&#123;</span><br><span class="line"> head = head-&gt;link;</span><br><span class="line"> printf(&quot;%c&quot;, head-&gt;data);</span><br><span class="line"> head = head-&gt;link;</span><br><span class="line"> while (head != NULL) &#123;</span><br><span class="line"> printf(&quot;%c&quot;, head-&gt;data);</span><br><span class="line"> head = head-&gt;link;</span><br><span class="line"> &#125;</span><br><span class="line">&#125;</span><br><span class="line">int Length(struct Node* L)//表长统计函数</span><br><span class="line">&#123;</span><br><span class="line"> int len = 0; //统计表长</span><br><span class="line"> struct Node *p = L;</span><br><span class="line"> while (p-&gt;link != NULL) &#123;</span><br><span class="line"> p = p-&gt;link;</span><br><span class="line"> len = len + sizeof(struct Node);</span><br><span class="line"> &#125;</span><br><span class="line"> return len;</span><br><span class="line">&#125;</span><br><span class="line">void getItem(Node head, int j)//通过位置获取对应结构体子数据的函数</span><br><span class="line">&#123;</span><br><span class="line"> Node *p = head.link;</span><br><span class="line"> int i = 2;</span><br><span class="line"> while (p&amp;&amp;i &lt; j*2) //找到第j个位置，当遍历到链表尾或j的值小于1时跳出循环</span><br><span class="line"> &#123;</span><br><span class="line"> p = p-&gt;link;</span><br><span class="line"> i++;</span><br><span class="line"> &#125;</span><br><span class="line"> if (!p || i &gt; j*2) //判断找到的位置是否正确，表尾或i&gt;j均输出错误</span><br><span class="line"> &#123; //i&lt;j是指输入的位置小于0,即不在链表内</span><br><span class="line"> printf(&quot;请输入正确的位置，%d该位置不在范围内\n&quot;, j);</span><br><span class="line"> &#125;</span><br><span class="line"> else</span><br><span class="line"> &#123;</span><br><span class="line"> printf(&quot;第%d个位置的字符为%c\n&quot;, j, p-&gt;data);</span><br><span class="line"> &#125;</span><br><span class="line">&#125;</span><br><span class="line">void LocateElem(Node L) //对应元素位置寻找</span><br><span class="line">&#123;</span><br><span class="line"> //声明一个指针 </span><br><span class="line"> Node *p=L.link;</span><br><span class="line"> char j = &#x27;a&#x27;;</span><br><span class="line"> //计数器 </span><br><span class="line"> int i = 2;</span><br><span class="line"> //当指针指向的结点不为空，并且指针指向的结点的数据域与要查找的值不相等 </span><br><span class="line"> while (p &amp;&amp; p-&gt;data != j) </span><br><span class="line"> &#123;</span><br><span class="line"> p = p-&gt;link;</span><br><span class="line"> i++;</span><br><span class="line"> &#125;</span><br><span class="line"> i = i / 2;</span><br><span class="line"> if (p)</span><br><span class="line"> printf(&quot;位置为：1\n&quot;);//如果指针指向的结点不为空，则输出计数器的内容，也即是结点数据域的位置 </span><br><span class="line"> else</span><br><span class="line"> printf(&quot;未找到该数据\n&quot;);//如果指针为空，则表明未找到该数据 </span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line">int main(void)</span><br><span class="line">&#123;</span><br><span class="line"> int n, i,pos(1),len;</span><br><span class="line"> char newelem;</span><br><span class="line"> char* a;</span><br><span class="line"> printf(&quot;结构体总数：&quot;);</span><br><span class="line"> scanf(&quot;%d\n&quot;, &amp;n);</span><br><span class="line"> a = (char*)malloc(n * sizeof(char)); //动态内存分配申请字符串空间</span><br><span class="line"> len = n;</span><br><span class="line"> n = n * 2;</span><br><span class="line"> for (i = 0; i &lt; n; i++)</span><br><span class="line"> &#123;</span><br><span class="line"> scanf(&quot;%c&quot;, &amp;a[i]);</span><br><span class="line"> &#125;</span><br><span class="line"> printf(&quot;\n&quot;);</span><br><span class="line"> struct Node* temp = NULL; //声明一个指针变量temp</span><br><span class="line"> temp = buildLinkedList(a, n);//创建链表，把返回的头指针赋值给temp指针变量</span><br><span class="line"> printLinkedList(temp);//打印链表：整个链表用temp来代表。</span><br><span class="line"> printf(&quot;\n结构体总长度：%d\n&quot;, Length(temp));</span><br><span class="line"> if (temp-&gt;link == NULL)</span><br><span class="line"> printf(&quot;空&quot;);</span><br><span class="line"> else</span><br><span class="line"> printf(&quot;非空&quot;);//判断单链表是否为空</span><br><span class="line"> printf(&quot;\n输入所求字符位置：&quot;);</span><br><span class="line"> scanf(&quot;%d&quot;,&amp;pos);</span><br><span class="line"> getItem(*temp,pos);</span><br><span class="line"> printf(&quot;寻找字符a的位置\n&quot;);</span><br><span class="line"> LocateElem(*temp);</span><br><span class="line"> printf(&quot;输入修改字符位置：&quot;);</span><br><span class="line"> scanf(&quot;%d&quot;, &amp;pos);</span><br><span class="line"> printf(&quot;输入修改的字符：&quot;);</span><br><span class="line"> scanf(&quot;%s&quot;, &amp;newelem);</span><br><span class="line"> temp=insertElem(temp, newelem, pos);</span><br><span class="line"> printLinkedList(temp);//再次打印链表</span><br><span class="line"> printf(&quot;输入删除的位置：&quot;);</span><br><span class="line"> scanf(&quot;%d&quot;, &amp;pos);</span><br><span class="line"> temp = delElem(temp, pos);</span><br><span class="line"> printLinkedList(temp);//再次打印链表</span><br><span class="line"> system(&quot;pause&quot;);</span><br><span class="line"> return 0;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
<link rel="stylesheet" href="/css/spoiler.css" type="text/css"><script src="/js/spoiler.js" type="text/javascript" async></script>
</div>
<div class="reward-container">
<div>欢迎打赏</div>
<button onclick="var qr = document.getElementById('qr'); qr.style.display = (qr.style.display === 'none') ? 'block' : 'none';">
打赏
</button>
<div id="qr" style="display: none;">
<div style="display: inline-block;">
<img src="/images/wechatpay.jpg" alt="llbzow 微信支付">
<p>微信支付</p>
</div>
</div>
</div>
<footer class="post-footer">
<div class="post-tags">
<a href="/tags/%E8%BD%AF%E4%BB%B6%E6%8A%80%E6%9C%AF%E5%9F%BA%E7%A1%80/" rel="tag"># 软件技术基础</a>
</div>
<div class="post-nav">
<div class="post-nav-item">
<a href="/2022/11/01/%E5%85%B3%E4%BA%8E%E7%AC%AC%E4%B8%80%E6%AC%A1%E6%95%B0%E7%94%B5%E5%AE%9E%E9%AA%8C%E7%9A%84%E9%97%AE%E9%A2%98/" rel="prev" title="关于第一次数电实验的问题">
<i class="fa fa-chevron-left"></i> 关于第一次数电实验的问题
</a></div>
<div class="post-nav-item">
<a href="/2022/11/08/%E8%BD%AF%E4%BB%B6%E6%8A%80%E6%9C%AF%E5%9F%BA%E7%A1%80%E7%AC%AC%E4%B8%89%E6%AC%A1%E5%AE%9E%E9%AA%8C/" rel="next" title="软件技术基础第三次实验">
软件技术基础第三次实验 <i class="fa fa-chevron-right"></i>
</a></div>
</div>
</footer>
</article>
</div>
<div class="comments" id="gitalk-container"></div>
<script>
window.addEventListener('tabs:register', () => {
let { activeClass } = CONFIG.comments;
if (CONFIG.comments.storage) {
activeClass = localStorage.getItem('comments_active') || activeClass;
}
if (activeClass) {
let activeTab = document.querySelector(`a[href="#comment-${activeClass}"]`);
if (activeTab) {
activeTab.click();
}
}
});
if (CONFIG.comments.storage) {
window.addEventListener('tabs:click', event => {
if (!event.target.matches('.tabs-comment .tab-content .tab-pane')) return;
let commentClass = event.target.classList[1];
localStorage.setItem('comments_active', commentClass);
});
}
</script>
</div>
<div class="toggle sidebar-toggle">
<span class="toggle-line toggle-line-first"></span>
<span class="toggle-line toggle-line-middle"></span>
<span class="toggle-line toggle-line-last"></span>
</div>
<aside class="sidebar">
<div class="sidebar-inner">
<ul class="sidebar-nav motion-element">
<li class="sidebar-nav-toc">
文章目录
</li>
<li class="sidebar-nav-overview">
站点概览
</li>
</ul>
<!--noindex-->
<div class="post-toc-wrap sidebar-panel">
<div class="post-toc motion-element"><ol class="nav"><li class="nav-item nav-level-2"><a class="nav-link" href="#%E5%85%88%E6%94%BE%E5%B7%A5%E7%A8%8B%E6%96%87%E4%BB%B6%E5%86%85%E5%AE%B9-%E5%B7%A5%E7%A8%8B%E5%86%85%E5%AE%B9%E4%B8%BA%E7%AC%AC%E4%B8%80%E6%AC%A1%E5%81%9A%E7%9A%84%E6%AF%8D%E6%9C%AC%EF%BC%8C%E5%AE%9E%E9%99%85%E5%86%99%E5%AE%9E%E9%AA%8C%E6%8A%A5%E5%91%8A%E6%97%B6%E5%BB%BA%E8%AE%AE%E4%BF%AE%E6%94%B9%E4%BB%A3%E7%A0%81%E8%93%9D%E6%9C%AC"><span class="nav-number">1.</span> <span class="nav-text">先放工程文件内容(工程内容为第一次做的母本，实际写实验报告时建议修改代码蓝本)</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#%E7%AC%AC%E4%B8%80%E6%AC%A1%E5%AE%9E%E9%AA%8C%E4%BB%A3%E7%A0%81"><span class="nav-number">1.1.</span> <span class="nav-text">第一次实验代码</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#%E7%AC%AC%E4%BA%8C%E6%AC%A1%E5%AE%9E%E9%AA%8C%E4%BB%A3%E7%A0%81"><span class="nav-number">1.2.</span> <span class="nav-text">第二次实验代码</span></a></li></ol></li></ol></div>
</div>
<!--/noindex-->
<div class="site-overview-wrap sidebar-panel">
<div class="site-author motion-element" itemprop="author" itemscope itemtype="http://schema.org/Person">
<img class="site-author-image" itemprop="image" alt="llbzow"
src="/images/avatar.png">
<p class="site-author-name" itemprop="name">llbzow</p>
<div class="site-description" itemprop="description"></div>
</div>
<div class="site-state-wrap motion-element">
<nav class="site-state">
<div class="site-state-item site-state-posts">
<a href="/archives/">
<span class="site-state-item-count">7</span>
<span class="site-state-item-name">日志</span>
</a>
</div>
<div class="site-state-item site-state-categories">
<a href="/categories/">
<span class="site-state-item-count">2</span>
<span class="site-state-item-name">分类</span></a>
</div>
<div class="site-state-item site-state-tags">
<a href="/tags/">
<span class="site-state-item-count">2</span>
<span class="site-state-item-name">标签</span></a>
</div>
</nav>
</div>
</div>
</div>
</aside>
<div id="sidebar-dimmer"></div>
</div>
</main>
<footer class="footer">
<div class="footer-inner">
<div class="copyright">
&copy; 2022-06 –
<span itemprop="copyrightYear">2022</span>
<span class="with-love">
<i class="fa fa-heart"></i>
</span>
<span class="author" itemprop="copyrightHolder">llbzow</span>
</div>
<!--
<div class="powered-by">由 <a href="https://hexo.io/" class="theme-link" rel="noopener" target="_blank">Hexo</a> & <a href="https://theme-next.org/" class="theme-link" rel="noopener" target="_blank">NexT.Gemini</a> 强力驱动
</div>
-->
<div class="busuanzi-count">
<script async src="https://busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script>
<span class="post-meta-item" id="busuanzi_container_site_uv" style="display: none;">
<span class="post-meta-item-icon">
<i class="fa fa-user"></i>
</span>
<span class="site-uv" title="总访客量">
<span id="busuanzi_value_site_uv"></span>
</span>
</span>
<span class="post-meta-divider">|</span>
<span class="post-meta-item" id="busuanzi_container_site_pv" style="display: none;">
<span class="post-meta-item-icon">
<i class="fa fa-eye"></i>
</span>
<span class="site-pv" title="总访问量">
<span id="busuanzi_value_site_pv"></span>
</span>
</span>
</div>
</div>
</footer>
</div>
<script color='0,0,255' opacity='0.5' zIndex='-1' count='99' src="/lib/canvas-nest/canvas-nest.min.js"></script>
<script size="300" alpha="0.6" zIndex="-1" src="/lib/canvas-ribbon/canvas-ribbon.js"></script>
<script src="/lib/anime.min.js"></script>
<script src="/lib/velocity/velocity.min.js"></script>
<script src="/lib/velocity/velocity.ui.min.js"></script>
<script src="/js/utils.js"></script>
<script src="/js/motion.js"></script>
<script src="/js/schemes/pisces.js"></script>
<script src="/js/next-boot.js"></script>
<script defer src="/lib/three/three.min.js"></script>
<link rel="stylesheet" href="//cdn.jsdelivr.net/npm/gitalk@1/dist/gitalk.min.css">
<script>
NexT.utils.loadComments(document.querySelector('#gitalk-container'), () => {
NexT.utils.getScript('//cdn.jsdelivr.net/npm/gitalk@1/dist/gitalk.min.js', () => {
var gitalk = new Gitalk({
clientID : '1e2867144d855824b913# GitHub Application Client ID',
clientSecret: '3c474768436b020bd64b81c163e40c7ac7e3f1d6# GitHub Application Client Secret',
repo : 'BlogComments# Repository name to store issues',
owner : 'llbzow# GitHub repo owner',
admin : ['llbzow# GitHub repo owner and collaborators, only these guys can initialize gitHub issues'],
id : '50df254c343aaee3d85ee905ab2bfccf',
language: '',
distractionFreeMode: true
});
gitalk.render('gitalk-container');
}, window.Gitalk);
});
</script>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink