vue注册用户使用v-model实现数据双向绑定

于 2025-05-10 17:13:19 发布
阅读量289 收藏
点赞数 2
分类专栏： WEB 文章标签： vue.js javascript ecmascript
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/anqixiang/article/details/147856096
版权

定义数据模型

Login.vue

//定义数据模型
const registerData = ref({
    username: '',
    password: '',
    confirmPassword: ''
})

使用 v-model 实现数据模型的key与注册表单中的元素之间的双向绑定

在这里插入图片描述

<!-- 注册表单 -->
            <el-form ref="form" size="large" autocomplete="off" v-if="isRegister" :model="registerData">
                <el-form-item>
                    <h1>注册</h1>
                </el-form-item>
                <el-form-item>
                    <el-input :prefix-icon="User" placeholder="请输入用户名" v-model="registerData.username"></el-input>
                </el-form-item>
                <el-form-item>
                    <el-input :prefix-icon="Lock" type="password" placeholder="请输入密码" v-model="registerData.password"></el-input>
                </el-form-item>
                <el-form-item>
                    <el-input :prefix-icon="Lock" type="password" placeholder="请输入再次密码" v-model="registerData.confirmPassword"></el-input>
                </el-form-item>
                <!-- 注册按钮 -->
                <el-form-item>
                    <el-button class="button" type="primary" auto-insert-space>
                        注册
                    </el-button>
                </el-form-item>
                <el-form-item class="flex">
                    <el-link type="info" :underline="false" @click="isRegister = false">
                        ← 返回
                    </el-link>
                </el-form-item>
            </el-form>
[LeetCode]--290. Word Pattern
杜鲁门的博客
10-16 679
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.Examples:
leetcode笔记：Word Pattern
liyuefeilong的专栏
02-15 1884
题目的大意是，给出一组模式（pattern）和一个字符串（str），判断字符串是否与模式相匹配，并给出了几个例子。
LEETCODE 290
zj443108444的博客
03-26 404
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
LeetCode:Word Pattern
walker lee
01-12 486
Word Pattern Total Accepted: 21299 Total Submissions: 77656 Difficulty: Easy Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match,
LeetCode 290:Word Pattern
judadeshu的博客
12-20 462
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
《leetCode》：Word Pattern
wojiushimogui的博客
04-08 480
题目Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.Examples:
LeetCode 290. 单词规律
Ray.C.L的博客
12-24 1786
思路：建立双射，判断是不是满射，和双射是否对应 代码： class Solution { public: bool wordPattern(string pattern, string s) { vector<string> words; stringstream ssin(s); string word; while(ssin>>word) words.push_back(word); if(.
【LeetCode 面试经典150题】290. Word Pattern 单词规律
qq_43513394的博客
01-10 387
Given a pattern and a string , find if follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in and a non-empty word in .给定一个模式 和一个字符串 ，判断 是否遵循相同的模式。这里的遵循意味着完全匹配，即 中的每个字母和 中的非空单词之间存在一一对应的关系。Example 1
LeetCode 290. 单词规律（python）
weixin_44740082的博客
06-14 605
题目链接 题目描述： 给定一种规律 pattern 和一个字符串 str ，判断 str 是否遵循相同的规律。 这里的 遵循 指完全匹配，例如， pattern 里的每个字母和字符串 str 中的每个非空单词之间存在着双向连接的对应规律。 示例1: 输入: pattern = “abba”, str = “dog cat cat dog” 输出: true 示例 2: 输入:pattern = “...
leetcode 290. 单词规律（Java版）
热门推荐
寒泉
12-30 6万+
题目 https://leetcode-cn.com/problems/word-pattern/ 题解 题目要求 pattern 里的每个字母和字符串 str 中的每个非空单词之间存在着 双向连接 的对应规律，因此，建立两个 hashmap，分别验证正向、反向是否对应即可。 class Solution { public boolean wordPattern(String pattern, String s) { HashMap<Character, String>
290. Word Pattern(技巧：记录当前位置来判断两个字符串是否符合)
u010005161的博客
05-30 1122
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
Word Pattern
u011860731的专栏
10-13 1950
题目： Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word
leetcode：290. Word Pattern
GZY的博客
06-06 265
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.
Leetcode290. Word Pattern & 205. Isomorphic Strings
大锅八十小锅四十
01-23 383
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.Examples:
leetcode:Word Pattern
martin_liang的专栏
10-17 620
Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str. Examp
LeetCode290 Word Pattern 同构字符串
ncst
10-29 304
题目要求: Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.Exam
【LeetCode】290. Word Pattern (Python实现)
果冻先生的专栏
09-11 442
参考链接：https://blog.csdn.net/coder_orz/article/details/51693647 Given apatternand a stringstr, find ifstrfollows the same pattern. Herefollowmeans a full match, such that there is a bijection b...
LeetCode题解：Word Pattern
追风筝的吃货，汪～
02-28 574
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.Examples:
class Solution { public: bool wordPattern(string pattern, string str) { unordered_map<string, char> str2ch; unordered_map<char, string> ch2str; int m = str.length(); int i = 0; for (auto ch : pattern) { if (i >= m) { return false; } int j = i; while (j < m && str[j] != ' ') j++; const string &tmp = str.substr(i, j - i); if (str2ch.count(tmp) && str2ch[tmp] != ch) { return false; } if (ch2str.count(ch) && ch2str[ch] != tmp) { return false; } str2ch[tmp] = ch; ch2str[ch] = tmp; i = j + 1; } return i >= m; } }; 作者：力扣官方题解 链接：https://leetcode.cn/problems/word-pattern/solutions/523102/dan-ci-gui-lu-by-leetcode-solution-6vqv/ 来源：力扣（LeetCode） 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。
最新发布
04-03
bool wordPattern(string pattern, string str) { // 声明并定义了公有的wordPattern函数，返回值类型为bool，参数是一个字符串pattern和另一个字符串str unordered_map, char> str2ch; // 创建一个unordered_...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值