Word Break Problem 动态规划

本文介绍了一种解决单词拆分问题的算法实现。通过动态规划方法判断一个字符串是否能被拆分为字典中存在的单词序列。文章提供了完整的C++代码示例,并通过几个测试用例验证了算法的有效性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

// Word Break Problem.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <string>

using namespace std;

int dictionaryContains(string word)
{
    string dictionary[] = {"mobile","samsung","sam","sung","man","mango",
                           "icecream","and","go","i","like","ice","cream"};
    int size = sizeof(dictionary)/sizeof(dictionary[0]);
    for (int i = 0; i < size; i++)
        if (dictionary[i].compare(word) == 0)
           return true;
    return false;
}

bool wordBreak(string str)
{
	int size = str.size();

	if (size == 0)  
		return true;
	
	bool *wb = new bool[size+1];

	for (int i = 0; i<= size; i++)
	{
		wb[i] = false;
	}
	wb[0] = true;

	for (int i = 0; i<size; i++)// idx of the inputed string
	{
		for (int j = 0; j<=i; j++)
		{
			if (wb[j] == true)
			{
				if (dictionaryContains(str.substr(j, i-j+1)))
				{
					wb[i+1] = true;
					break;
				}
			}
		}
	}

	bool retVal = wb[size] == true? true:false;

	delete [] wb;

	return retVal;
}


int _tmain(int argc, _TCHAR* argv[])
{
    wordBreak("ilikesamsung")? cout <<"Yes\n": cout << "No\n";
    wordBreak("iiiiiiii")? cout <<"Yes\n": cout << "No\n";
    wordBreak("")? cout <<"Yes\n": cout << "No\n";
    wordBreak("ilikelikeimangeiii")? cout <<"Yes\n": cout << "No\n";
    wordBreak("samsungandmango")? cout <<"Yes\n": cout << "No\n";
    wordBreak("samsungandmangok")? cout <<"Yes\n": cout << "No\n";
	return 0;
}




                
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值