FilesExpand file tree

 DSA

/

Recursion1.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

289 lines (201 loc) · 6.71 KB

 DSA

/

Recursion1.java

Copy path

Top

File metadata and controls

• Code
• Blame

289 lines (201 loc) · 6.71 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

import java.util.ArrayList;

import java.util.Arrays;

import java.util.List;

public class Recursion1 {

public static void main(String[] args) {

subserq("", "abc");

System.out.println(lsubset("", "cba"));

System.out.println(ASCIIsubset("", "abc"));

//1:-

int [] arr = {1,2,3,4,5};

System.out.println(numsubset(arr));

//2 :-

List<List<Integer>> ans = numsubset(arr);

for (List <Integer> list : ans ){

System.out.println(list);

}

// for duplicate :-

int [] arr1 = {2,1,2};

List<List<Integer>> ans1 = numsubsetDuplicate(arr1);

for (List <Integer> list : ans1){

System.out.println(list);

}

System.out.println(numsubsetDuplicate(arr1));

// permutations :-

parmutations("","abc");

System.out.println( parmutationslist("", "abc"));

// in list form

digitalpha("", "12");

System.out.println(digitalphalist("", "123"));

// count of above :=

System.out.println(digitalphacount("", "12"));

// dice ;-

dice("", 4);

System.out.println(dicelist("", 4));

}

// sub set making

static void subserq (String p , String up){

if (up.isEmpty()){

System.out.println(p);

return;

}

char c = up.charAt(0);

subserq(p+c, up.substring(1));

subserq(p, up.substring(1));

}

// sub set returing in arraylist

static ArrayList<String> lsubset (String empty , String Tochange){

if (Tochange.isEmpty()){

ArrayList<String> l1 = new ArrayList<>();

l1.add(empty);

return l1;

}

char c = Tochange.charAt(0);

ArrayList <String> left = lsubset(c+empty, Tochange.substring(1));

ArrayList <String> right = lsubset(empty, Tochange.substring(1));

left.addAll(right);

return left;

}

// return with ASCII value :=

static ArrayList<String> ASCIIsubset (String empty , String Tochange){

if (Tochange.isEmpty()){

ArrayList<String> l1 = new ArrayList<>();

l1.add(empty);

return l1;

}

char c = Tochange.charAt(0);

ArrayList <String> first = ASCIIsubset(c+empty, Tochange.substring(1));

ArrayList <String> second = ASCIIsubset(empty, Tochange.substring(1));

ArrayList <String> third = ASCIIsubset((empty) + (c + 0), Tochange.substring(1));

first.addAll(second);

first.addAll(third);

return first;

}

// by iterrative process :-

static List<List<Integer>> numsubset (int [] arr){

List<List<Integer>> Outer = new ArrayList<>();

Outer.add(new ArrayList<>());

for (int num : arr){

int n = Outer.size();

for (int i = 0; i < n; i++) {

List <Integer> Inner = new ArrayList<>(Outer.get(i));

Inner.add(num);

Outer.add(Inner);

}

}

return Outer;

}

// above for duplicate

static List<List<Integer>> numsubsetDuplicate (int [] arr){

List<List<Integer>> Outer = new ArrayList<>();

Outer.add(new ArrayList<>());

Arrays.sort(arr);

int start = 0 ;

int end = 0;

for (int i = 0; i < arr.length; i++) {

start = 0;

if (i > 0 && arr[i]==arr[i-1]){

start = end -1 ;

}

end =Outer.size()-1 ;

int n = Outer.size();

for (int j = start; j < n; j++) {

List <Integer> Inner = new ArrayList<>(Outer.get(j));

Inner.add(arr[i]);

Outer.add(Inner);

}

}

return Outer;

}

// parmutations :-

static void parmutations (String p , String up){

if (up.isEmpty()){

System.out.println(p);

return;

}

char ch = up.charAt(0);

for (int i = 0; i <= p.length(); i++) {

String f = p.substring(0 , i);

String s = p.substring(i ,p.length());

parmutations(f+ch+s, up.substring(1));

}

}

static ArrayList<String> parmutationslist (String p , String up){

if (up.isEmpty()){

ArrayList<String> list = new ArrayList<>();

list.add(p);

return list ;

}

char ch = up.charAt(0);

ArrayList<String> ans = new ArrayList<>();

for (int i = 0; i <= p.length(); i++) {

String f = p.substring(0 , i);

String s = p.substring(i ,p.length());

ans.addAll( parmutationslist(f+ch+s, up.substring(1)));

}

return ans ;

}

// mobile digit pad conversion :-

static void digitalpha (String p , String up){

if (up.isEmpty()){

System.out.println(p);

return;

}

int digit = up.charAt(0) - '0' ; // to convert '2' into 2

for (int i = (digit-1)* 3; i < digit *3; i++) {

char ch = (char) ('a' + i );

digitalpha(p+ch, up.substring(1));

}

}

//list form of above

static ArrayList <String> digitalphalist (String p , String up){

if (up.isEmpty()){

ArrayList<String > list = new ArrayList<>();

list.add(p);

return list ;

}

int digit = up.charAt(0) - '0' ; // to convert '2' into 2

ArrayList<String> ans = new ArrayList<>();

for (int i = (digit-1)* 3; i < digit *3; i++) {

char ch = (char) ('a' + i );

ans.addAll(digitalphalist(p+ch, up.substring(1)));

}

return ans ;

}

// counting only permutation:-

static int digitalphacount (String p , String up){

if (up.isEmpty()){

return 1 ;

}

int digit = up.charAt(0) - '0' ; // to convert '2' into 2

int count = 0 ;

for (int i = (digit-1)* 3; i < digit *3; i++) {

char ch = (char) ('a' + i );

count = count +digitalphacount(p+ch, up.substring(1));

}

return count ;

}

// dice target finding ;-

static void dice (String p , int target){

if (target == 0){

System.out.println(p);

return;

}

for (int i = 1; i <= 6 && i <= target; i++) {

dice(p +i, target -i);

}

}

//list

static ArrayList <String > dicelist (String p , int target){

if (target== 0){

ArrayList<String > list = new ArrayList<>();

list.add(p);

return list;

}

ArrayList<String > list = new ArrayList<>();

for (int i = 1; i <= 6 && i <= target; i++) {

list.addAll(dicelist(p +i, target -i));

}

return list ;

}

}